First the user inputs a positive integer N. Suppose N is 5. 
Then the program expects 5 more positive integers that it will 
test for primality. For example, the input could look like:

5
5915587277
15004502713121
32670001
57548533437
4093

The program will test the five given numbers for primality and 
output two floating point numbers. The first output number is the 
average time it took the naive algorithm to test these 5 numbers for 
primality. The second time is the average time it took the fast algorithm 
to test these 5 numbers for primality. So the output should look like:

0.000300046
0.000102021

(I just made up the above numbers and your timings will likely be different.)
Note again the minimal nature of the input-output interaction, i.e., there are
no prompts/messages, etc.