#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
#include <memory>
#include<time.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-9;
const double PI  = acos(-1.0);

typedef vector<double> vd;
typedef vector<vd> vvd;

int n;
double dfs(int mask,int pos,int last, vvd &dp,vi &r){
	if(pos==n){
		return r[last];
	}
	if(dp[mask][last]){
		return dp[mask][last];
	}
	double ret=INT_MAX;
	REP(i,n){
		if(!((1<<i)&mask)){
			ret=min(ret,dfs(mask|(1<<i),pos+1,i,dp,r)+sqrt(r[last]*r[i])*2);
		}
	}
	return dp[mask][last]=ret;
}

int main(){
	string line;
	while(getline(cin,line)){
		istringstream iss(line);
		int l;
		iss>>l;
		vi r;
		int rr;
		while(iss>>rr){
			r.push_back(rr);
		}
		n=r.size();

		double ans=INT_MAX;
		REP(i,n){
			vvd dp(1<<n,vd(n));
			ans=min(ans,dfs(1<<i,1,i,dp,r)+r[i]);
		}
		cout<<(ans<l+EPS?"OK":"NA")<<endl;
	}
}