#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define flog(n) 31-__builtin_clz((n))
#define clog(n) 32-__builtin_clz((n)-1)
#define fori(i,a,b) for(long long int i=(a);i<=(b);i++)
#define forib(i,a,b) for(long long int i=(a);i>=(b);i--)
using ll=long long; using pi=pair<int,int>; using vi=vector<int>; using vl=vector<ll>;


void solve(){
  ll n; cin >> n;
  bool ok = false;
  vl curr;
  while (true){
    ll m = n % 10;
    ll neu = n / 10 - m * 11;
    if (neu <= 0){
        if (n % 37 == 0){
            ok = true;
        }
        break;
    }
    n = neu;
    curr.pb(neu);
  }
  cout << (ok ? "IGEN" : "NEM") << endl;
  if (curr.size() == 0) {
    cout << 0 << " ";
  } else {
      fori(i, 0, curr.size() - 1){
          cout << curr[i] << " ";
      }
  }
  cout << endl;
}
int main() {
  if(true){ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
  solve();
}