# Program for finding first n prime numbers which  are fibonacci numbers also.


from time import clock
import sys

def fibo_primes(PrintThisMuch):    
    memory=0
    PrintThisMuch-=1
    count=0
    prevFibo,curFibo=1,1
    fibo_prime_list=[]
    while (count<=PrintThisMuch):
      flag=0
      prevFibo,curFibo = curFibo,prevFibo+curFibo
      for i in range(2,curFibo):        
        if(curFibo%i == 0):
          flag=1
          break
      if(flag==0):
        fibo_prime_list.append(curFibo)
        count+=1
    memory=3 * sys.getsizeof(PrintThisMuch) +sys.getsizeof(prevFibo)
    + sys.getsizeof(curFibo) + sys.getsizeof(fibo_prime_list)
    return (fibo_prime_list,memory)



def main():
  f=open("c:\inputs\in3_3.txt")
  for row in f:
    temp=row.split(',')
  length = len(temp)
  f.close()
  f1=open("out_3_sec3_3te.txt","w")
  for i in range(0,length):
    start= clock()
    value,memory=fibo_primes(int(temp[i]))
    time_taken=clock()-start  
    f1=open("out_3_sec3_3te.txt","a")
    f1.write("\n " + str(temp[i]) + " Prime Fibonacci number is     "
             + str(value))
    f1.write("\n Time Taken = " + str(time_taken))
    f1.write("\n Memory taken = " + str(memory) + " bytes.\n");
    f1.close()

main()