Ural1349(费马大定理)

#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <string>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
typedef long long LL;
const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-9;
const double PI = acos(-1.0); //M_PI;

int main()
{
    #ifdef DoubleQ
    freopen("in.txt","r",stdin);
    #endif
    int n;
    while(cin >> n)
    {
        if(n == 1)
            cout << "1 2 3" << endl;
        else if(n == 2)
            cout << "3 4 5" << endl;
        else
            cout << "-1" << endl;
    }
}