def genarate_fibbonacci(n):
    result = [0, 1]
    number_to_add = 0
    for number in range(1, n):
        number_to_add = result[number] + result[number-1]
        result.append(number_to_add)
    return result

def is_primary(number):
    for item in range(2, number//2):
        if number % item == 0:
            return False
    return True

def get_primary_fibbonacci(items_to_return):
    fibbonacci_sequence = [0, 1, 1]
    primary_fibbonacci_list = []
    current_qty = 0
    index = 2

    while True:
        fibbonacci_sequence.append(fibbonacci_sequence[index] + fibbonacci_sequence[index - 1])
        index += 1
        if is_primary(fibbonacci_sequence[index]):
            primary_fibbonacci_list.append(fibbonacci_sequence[index])
            current_qty += 1

        if current_qty == items_to_return:
            break
    return primary_fibbonacci_list

print(get_primary_fibbonacci(7))