#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

#define SQR(x) ((x) * (x))


double calcDirec(int r, int l)
{	return sqrt(SQR(r + l) - SQR(r - l));	}

double memo[12][1 << 12];
int n;

double rec(vint& rs, int prv, int u)
{
	if(u + 1 == 1 << n)	return prv;
	if(prv != -1 && memo[prv][u] != -1) return memo[prv][u];
	
	double res = 1 << 20;
	
	rep(i, n) if(!(u & 1 << i)) chmin(res, rec(rs, rs[i], u | 1 << i) + (prv == -1 ? rs[i] : calcDirec(prv, rs[i])));
	
	return (prv != -1 ? memo[prv][u] = res : res);
}

int main()
{
    for(string line; getline(cin, line);)
	{
		rep(i, 12) rep(j, 1 << 12) memo[i][j] = -1;
		vint rs;
		
		istringstream iss(line);
		
		string str; iss >> str;
		
		int H = atoi(str.c_str());
		
		for(n = 0; iss >> str; n++) rs.push_back(atoi(str.c_str()));
	
		cout << (rec(rs, -1, 0) <= H ? "OK" : "NA") << endl;
	}
}