#include<list>
//#include<algorithm>
#include<iostream>
//#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
  int i;
  int l,n;
  double m;
  char s[256],*t;
  while(fgets(s,256,stdin)!=0){
    l=atoi(strtok(s," "));
    list<int> r,q;
    for(n=0;(t=strtok(NULL," "))!=NULL;n++)
      r.push_back(atoi(t));
    r.sort();
    q.push_back(r.front());
    r.pop_front();
    for(;;){
      if(r.empty())
	break;
      q.push_front(r.back());
      r.pop_back();
      if(r.empty())
	break;
      q.push_back(r.back());
      r.pop_back();
      if(r.empty())
	break;
      q.push_front(r.front());
      r.pop_front();
      if(r.empty())
	break;
      q.push_back(r.front());
      r.pop_front();
    }
    m=0.0;
    list<int>::iterator it=q.begin();
    m+=*it;
    for(i=0;i<n-1;i++){
      int a,b;
      a=*it;
      it++;
      b=*it;
      m+=sqrt(a*b)*2;
    }
    m+=*it;
    if(m<=l)
      cout<<"OK"<<endl;
    else
      cout<<"NA"<<endl;
  }
  return 0;
}
/*
  int i,r[10];
  double l;
  cin>>r[0]>>r[1]>>r[2]>>r[3]>>r[4]>>r[5];
  l=0.0;
  l+=r[0];
  for(i=0;i<5;i++)
    l+=sqrt(r[i]*r[i+1])*2;
  l+=r[i];
  cout<<l<<endl;
  return 0;
}
*/