#include <bits/stdc++.h>

using namespace std;

const double inf = 1<<25;

int n, r[15];
double dp[1<<12][12];

double solve(int bit, int l)
{
  if(bit == (1<<n)-1) return r[l];
  double &ret = dp[bit][l];
  if(ret != -1.0) return ret;
  ret = inf;
  for(int i = 0; i < n; i++) {
    if(((bit >> i) & 1)) continue;
    ret = min(ret, solve(bit | (1<<i), i) + sqrt((r[l]+r[i])*(r[l]+r[i]) - (r[l]-r[i])*(r[l]-r[i])));
  }
  return ret;
}

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int W;
  while(cin >> W) {
    string in;
    cin.ignore();    
    getline(cin, in);
    stringstream ss(in);
    n = 0;
    while(ss >> r[n]) n++;
    double mn = inf;
    for(int i = 0; i < n; i++) {
      fill(dp[0], dp[1<<12], -1.0);
      mn = min(mn, solve(1<<i, i) + r[i]);
    }
    //cout << mn << endl;    
    if(mn <= W) puts("OK");
    else puts("NA");
  }
  
  return 0;
}