#include <stdlib.h>
#include <stdio.h>

int nextPrime(int x)
{
// Find a prime number >= x
int work,k,remainder,quotient;

if (x%2==1)
  work=x;
else
  work=x+1;

while (1)
{
  for (k=3; ;k+=2)
  {
    remainder=work%k;
    if (remainder==0)
      break;
    quotient=work/k;
    if (quotient<k)
      return work;
  }

  work+=2;
}
}

main()
{
int arr[100],target=0,i,j,k;

k=nextPrime(2);
for (i=0;i<25;i++)
  k=nextPrime(k+1);

for (i=0;i<100;i++)
{
  for (j=0;j<1002;j++)
    k=nextPrime(k+1);
  arr[i]=nextPrime(k+1);
  k=arr[i];
}

for (i=0;i<100;i++)
  if (i%20!=0)
    target+=arr[i];

printf("%d %d\n",100,target);
for (i=0;i<100;i++)
  printf("%d\n",arr[i]);
}