using System;

​

public class Program

{

    public static void Main()

    {

        long[] Primes = GetPrimes(9999), build = new long[4];

        int i = 1001, c1 = 0, c2 = 0;

        String s1, s2, s3;

        while (i <= 3339)

        {

            if (i != 1487)

            {

                if (IsPrime(i))

                {

                    s1 = i + "";

                    if (IsPrime(i + 3330))

                    {

                        s2 = i + 3330 + "";

                        for (int j = 0; j < 4; j++)

                        {

                            if (s1.Contains(s2[j] + ""))

                            {

                                c1++;

                            }

                        }

​

                        if (c1 == 4)

                        {

                            if (IsPrime(i + 3330 + 3330))

                            {

                                s3 = i + 6660 + "";

                                for (int j = 0; j < 4; j++)

                                {

                                    if (s1.Contains(s3[j] + ""))

                                    {

                                        c2++;

                                    }

                                }

                                if (c2 == 4)

                                {

                                    Console.WriteLine(i + "" + (i+3330)+"" + (i+6660)+"");

                                    break;

                                }

​

                            }

                        }

                    }

                }

            }

            c1 = 0;

            c2 = 0;

            i++;

        }

    }

​

    public static bool IsPrime(long num)

    {

        if (num == 1)

            return false;

        if (num == 2)

            return true;

        if (num % 2 == 0)

            return false;

        int s = (int)Math.Sqrt(num);

        for (int i = 3; i <= s; i += 2)

        {

            if (num % i == 0)

                return false;

        }

​

        return true;

    }

​

    public static long[] GetPrimes(int len)

    {

        long[] arr = new long[len];

        int counter = 0;

        for (int i = 1; i < len; i++)

        {

            if (IsPrime(i))

            {

                arr[counter] = i;

                counter++;

            }

        }

​

        long[] r = new long[counter];

        for (int i = 0; i < counter; i++)

            r[i] = arr[i];

        return r;

    }

}