#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  string in;
  while(getline(cin,in)){
    stringstream ss;
    ss<<in;
    int l,tmp;
    vector<int> r;
    ss>>l;
    while(ss>>tmp)r.push_back(tmp);
    vector<int> perm;
    REP(i,r.size()){
      perm.push_back(i);
    }
    bool able = false;
    do{
      double len = r[perm[0]] + r[perm[r.size()-1]];
      REP(i,r.size()-1){
        len += sqrt(4*r[perm[i]]*r[perm[i+1]]);
      }
      if(len<=(double)l){
        able = true;
        break;
      }
    }while(next_permutation(perm.begin(),perm.end()));
    if(able) cout<<"OK"<<endl;
    else cout<<"NA"<<endl;


  }
  return 0;
}