#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;

const int nmax=12;
int l,r[nmax],n;

void solve(){
  sort(r,r+n);
  deque<int> rr;
  bool f=true;
  for(int i=0;i<n/2;i++){
    if(f){
      rr.push_front(r[i]);
      rr.push_back(r[n-i-1]);
      f=false;
    }
    else {
      rr.push_front(r[n-i-1]);
      rr.push_back(r[i]);
      f=true;
    }
  }
  
  if(n==1){
    rr.push_front(r[0]);
  }
  else if(n%2==1){
    if(rr[0]>rr[n-2])rr.push_front(r[n/2]);
    else rr.push_back(r[n/2]);
  }

  double sum=rr[0]+rr[n-1];
  for(int i=0;i<n-1;i++){
    sum+=2*sqrt(rr[i]*rr[i+1]);
  }
  if(sum<=l)cout<<"OK"<<endl;
  else cout<<"NA"<<endl;
}

int main(){
  char c;
  while(cin>>l){
    n=0;
    while(~(c=getchar())){
      if(c=='\n')break;
      else if(c==' ')cin>>r[n++];
    }
    solve(); 
  }
  return 0;
}