def primemaker(n):
    Prime,p1,p2,k =[2,3],0,0,1 
    if n <= 0: return []
    elif n <= 2: return Prime[:n]
     
    while p1<=n or p2<=n: 
        p1, p2 = 6*k - 1, 6*k + 1
        if isprime(p1,Prime) and p1<=n : Prime.append(p1)
        if isprime(p2,Prime) and p2<=n : Prime.append(p2)
        k = k + 1         

    return Prime
    
def isprime(number,Prime):
    for i in range(0,len(Prime),1) :
        if not(number % Prime[i]): 
            return False             
    return True

import re
def AmIYelling(input_sentence):
    return True if(len(re.sub('[^a-z]','',input_sentence))==0) else False

dot,dash='.','-'
morse = {'a':[dot,dash],'b':[dash,dot,dot,dot],'c':[dash,dot,dash,dot],'d':[dash,dot,dot],'e':[dot],'f':[dot,dot,dash,dot],'g':[dash,dash,dot],'h':[dot,dot,dot,dot],""
         'i':[dot,dot],'j':[dot,dash,dash,dash],'k':[dash,dot,dash],'l':[dot,dash,dot,dot],'m':[dash,dash],'n':[dash,dot],'o':[dash,dash,dash],'p':[dot,dash,dash],'q':[dash,dash,dot,dash],""
         'r':[dot,dash,dot],'s':[dot,dot,dot],'t':[dash],'u':[dot,dot,dash],'v':[dot,dot,dot,dash],'w':[dot,dash,dash],'x':[dash,dot,dot,dash],'y':[dash,dot,dash,dash],'z':[dash,dot,dot],""
         '0':[dash,dash,dash,dash,dash],'1':[dot,dash,dash,dash,dash],'2':[dot,dot,dash,dash,dash],'3':[dot,dot,dot,dash,dash],'4':[dot,dot,dot,dot,dash],'5':[dot,dot,dot,dot,dot],""
         '6':[dash,dot,dot,dot,dot],'7':[dash,dash,dot,dot,dot],'8':[dash,dash,dash,dot,dot],'9':[dash,dash,dash,dash,dot],'*':' '}

def morse_code(msg):
    return "".join([j for i in msg.replace (" ", "*").lower() for j in morse[i]])

def AmIYelling(input_sentence):
  return input_sentence.isupper() or input_sentence.isdigit()
  

def divisors(n):
    a,x = [],0
    for i in range(1,int(n**0.5) + 1): 
        if not(n%i): 
            a.insert(x,i)
            x+=1
            a.insert(x,n//i)
    return a

def add(s, o):
    s = map(int, s)
    s = {
        1: (c for c in s if c % 2),
        2: (c for c in s if not c % 2),
    }.get(o, s);
    return sum(s)

class Sort:

    def merge_sort(self, nums):
        if nums == None: return None
        elif len(nums) <= 1: return nums
      
        vLeft = self.merge_sort(nums[:len(nums) // 2])
        vRight= self.merge_sort(nums[len(nums) // 2:])                 
        lLeft,lRight = len(vLeft),len(vRight)
        i,j,k = 0,0,0
        
        while i < lLeft and j < lRight:
            if vLeft[i] < vRight[j]:
                nums[k] = vLeft[i]
                i += 1
            else:
                nums[k] = vRight[j]
                j += 1
            k += 1

        while i < lLeft:
            nums[k] = vLeft[i]
            i += 1
            k += 1

        while j < lRight:
            nums[k] = vRight[j]
            j += 1
            k += 1

        return nums

def add(s, o):
    if o == 0: return sum(int(c) for c in s)
    elif o == 1: return sum(int(c) for c in s if int(c)%2)
    elif o == 2: return sum(int(c) for c in s if not(int(c)%2))
    else: return 0

#ORDEN O(1) SIN FOR, #Usado en Katas Anteriores por otro colaborador solo
#lo aplique para Python. 
def euler(n): return getMult(3,n-1) + getMult(5,n-1) - getMult(15,n-1)
def getMult(multiple, n): return getArith(multiple, n - n%multiple, int(n/multiple))
def getArith(first,last,count): return count * (first + last)/2

def distance(array):
    for i in range(len(array)):
        if "y" in array[i] : y = abs(array[i].index("y") - i)  
        if "x" in array[i] : x = abs(array[i].index("x") - i)  
    return (x+y)    

def hypotenuse(a,b):
    return round((a**2 + b**2)**0.5,4)

def fizz_buzz(n):
    return ['FizzBuzz' if (i % 15 == 0) else 'Fizz' if(i % 3 == 0) else 'Buzz' if(i % 5 == 0) else i for i in range(1,n)]
    

def getLongestWord(words):
    return '' if len(words) == 0 else max(words, key=len)