#include <math.h>

unsigned long long max_prime = 2000;

void prime_test()
{ 
  unsigned long long c;
  unsigned long long l,t;
  unsigned long long n=0;
  
  /* So far we're using very simple test prime number tests in 64bit */
  for(c=3; c < max_prime; c++)
  { 
    t = sqrt(c); 
    for(l = 2; l <= t; l++)
      if (c % l == 0)
        break;
    if (l > t )
      n++;
  }
}

int main()
{
  int i;

  for (i = 0 ; i < 10000 ; i++)
  {
    prime_test();
  }

  return 0;
}