#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
using namespace std;

using ll = long long;
const int MOD = 1e9 + 7;

vector<int> nums;

bool oszthato(int num) {
    int temp = (num / 10) - ((num%10)*11);
    if(temp >= 0) nums.push_back(temp);
    if(temp <= 0) {
        if(num % 37 == 0) return true;
        else return false;
    }
    return oszthato(temp);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    bool o = oszthato(n);
    if(o) cout << "IGEN\n";
    else cout << "NEM\n";
    if(nums.empty()) cout << "\n";
    else {
        for(int num : nums) {
            cout << num << " ";
        }
        cout << "\n";
    }
    return 0;
}