#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int dp[5][5][5][5];

bool solve(int* ISN, int* NKJ) {
  int& ret = dp[ISN[0]][ISN[1]][NKJ[0]][NKJ[1]];

  if(ret + 1) return ret;
  if(ISN[0] + ISN[1] == 0) return false;
  if(NKJ[0] + NKJ[1] == 0) return false;

  ret = 0;

  rep(i, 2) rep(j, 2) {
    if(!ISN[i]) continue;
    if(!NKJ[j]) continue;
    int tmp = NKJ[j];
    NKJ[j] += ISN[i];
    if(NKJ[j] >= 5) NKJ[j] = 0;
    ret |= !solve(NKJ, ISN);
    NKJ[j] = tmp;
  }
  return ret;
}

int main() {

  int ISN[2], NKJ[2]; cin >> ISN[0] >> ISN[1] >> NKJ[0] >> NKJ[1];
  minus(dp);
  cout << (solve(ISN, NKJ) ? "ISONO" : "NAKAJIMA") << endl;
  
  return 0;
}