from time import clock
import sys,math
def prime(n):
    size=0
    count=0
    division=0
    list=[2]
    j=3
    size=size+sys.getsizeof(count)+sys.getsizeof(division)+sys.getsizeof(list)+sys.getsizeof(j)
    while(count!=n-1):
        prime=0
        k=int(math.sqrt(j))
        for i in range(3,k+1,2):
            division=division+1
            if j%i==0:
                prime=1
                break
        if prime==0:
            count=count+1
            list.append(j)
        j=j+2
    size=size+sys.getsizeof(prime)+sys.getsizeof(i)+sys.getsizeof(k)
    return list,division,size
        
input=open("in_3_1.txt")
output=open("out_1_3_1.txt","w")
for row in input:
    n=int(row)
start=clock()
list,division,size=prime(n)
time=clock()-start
for i in range(n):
    if (i+1)%25==0 or i+1==n:
        output.write(str(list[i])+"\n")
    else:
        output.write(str(list[i])+",")
size=size+sys.getsizeof(i)+sys.getsizeof(n)+sys.getsizeof(list)+sys.getsizeof(division)
output.write("No of Divisions Are: "+str(division))
output.write("\nTime consumed is: "+str(time)+" secs")
output.write("\nMemory used by a program is: "+str(size)+" Bytes")
input.close()
output.close()