#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

typedef vector<double> vd;
typedef vector<vd> vvd;
const double INFTY=1e10;
const double EPS=1e-10;

int main()
{
	for(string s;getline(cin,s);){
		istringstream iss(s);
		int len;
		iss>>len;
		vi cakes;
		for(int cake;iss>>cake;)
			cakes.push_back(cake);
		
		int csize=cakes.size();
		vvd dp(1<<csize,vd(csize,INFTY));
		rep(i,csize)
			dp[1<<i][i]=cakes[i];
		repi(i,1,1<<csize){
			rep(j,csize)
				rep(k,csize){
					if((i&1<<j) && !(i&1<<k)){
						double x=sqrt(pow(cakes[j]+cakes[k],2)-pow(abs(cakes[j]-cakes[k]),2));
						dp[i|1<<k][k]=min(dp[i|1<<k][k],dp[i][j]+x);
					}
				}
		}
		
		bool ok=false;
		rep(i,csize)
			if(dp[(1<<csize)-1][i]+cakes[i]<=len+EPS)
				ok=true;
		cout<<(ok?"OK":"NA")<<endl;
	}
	
	return 0;
}