#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int getM(int x)
{
    int minDel = 999999999;
    int maxDel = -99999999;

    for (int i = 2; i < x; i++)
        if (x % i == 0)
        {
            if (i > maxDel)
                maxDel = i;

            if (i < minDel)
                minDel = i;
        }

    return maxDel - minDel;
}

int main()
{
    int count = 0;
    int i = 450000;

    while (count < 3)
    {
        if (getM(count) % 29 == 11)
            cout << count << getM(count) << endl;

        i++;
    }

    return 0;
}