// Generates A183216: primes that are the sum of 8 but not fewer squared primes.
// 811,1657,2131,2137,3323,3331,3457,4177,5003,5011,5843,5851,5857,6091,6691,7177,7411,7417,7523,7537,8363,8377,8731,8737,8963,8971,9203,9697,9923,9931,10883,10891,11243,11251,11257,11731,12577,12697,13411,13417,13523,13537,13883,14011,14243,14251
//
// Dmitry Kamenetsky, 1st of January, 2011.

import java.util.*;

public class A183216
{
    public static void main(String[] args)
    {
        int N=15000;
        int[] a=new int[N];                     //a[i] is the least number of squared primes that sum up to i
        Arrays.fill(a,Integer.MAX_VALUE);        
        a[0]=0;
        for (int i=0; i<N; i++)
        {
            if (a[i]==Integer.MAX_VALUE) continue;          //no squared primes sum up to i
            
            for (int k=2; i+k*k<N; k++)
                if (isPrime(k))
                    a[i+k*k]=Math.min(a[i+k*k],a[i]+1);
        }
 
        for (int i=0; i<N; i++) if (a[i]==8 && isPrime(i)) System.out.print(i+",");      
        System.out.println();
    }
        
    
	//returns true if the number is prime
	public static boolean isPrime(long a)
	{
		if (a<=1) return false;
		if (a==2) return true;
		if (a%2==0) return false;
		for (long i=3; i*i<=a; i+=2)
			if (a%i==0)
				return false;
		return true;
	}     
}