#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <cmath>
#define INF 9999999
using namespace std;

int W;
int R[12];
int N;
double D[13][12];
double dp[(1 << 12)][13];

void calcCost() {
  for(int u = 0; u <= N; ++u) {
    for(int v = 0; v < N; ++v) {
      if(u == v) D[u][v] = 0;
      else if(u == N || R[u] == R[v]) D[u][v] = R[v] * 2;
      else {
	double d = sqrt((R[u]+R[v])*(R[u]+R[v]) - (R[u]-R[v])*(R[u]-R[v]));
	D[u][v] = d - R[u] + R[v];
      }
    }
  }
}

void solve() {
  calcCost();
  for(int s = 0; s < (1 << N); ++s) {
    if(s == (1 << N) - 1) fill(dp[s], dp[s] + N+1, 0);
    else                  fill(dp[s], dp[s] + N+1, INF);
  }

  for(int s = (1 << N)-2; s >= 0; --s) {
    for(int u = 0; u <= N; ++u) {
      for(int v = 0; v < N; ++v) {
	dp[s][u] = min(dp[s][u], dp[s | (1 << v)][v] + D[u][v]);
      }
    }
  }
  if(dp[0][N] <= W) cout << "OK" << endl;
  else              cout << "NA" << endl;
}

int main() {
  string str;
  while(getline(cin, str) && !cin.eof()) {
    stringstream ss; ss << str;
    ss >> W;
    N = 0;
    while(!ss.eof()) {
      int tmp;
      ss >> tmp;
      R[N++] = tmp;
    }
    solve();
  }
}