500
Develop an algorithm for determining if a number is prime or composite.
1) enter the number
2) using a loop that starts at 0, count up the number
3) each time the program loops, check if the loop number is a factor of the inputted number
4) if it is a factor, increase a counter by 1
5) at the end of the loop, check if the counter is greater than 2
6) if the counter is greater than 2, the number is composite, otherwise it is prime.