#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
double dp[1<<12][12];
int main()
{
	string s;
	while(getline(cin,s))
	{
		for(int i=0;i<(1<<12);i++)for(int j=0;j<12;j++)dp[i][j]=INF;
		int n=0,sum,a[15];
		stringstream ss;
		ss << s;
		ss >> sum;
		while(!ss.eof())ss >> a[n++];
		for(int i=0;i<n;i++)dp[1<<i][i]=a[i];
		for(int i=0;i<(1<<n);i++)
		{
			for(int j=0;j<n;j++)
			{
				if((i>>j)&1)continue;
				for(int k=0;k<n;k++)
				{
					dp[i|1<<j][j]=min(dp[i|1<<j][j],dp[i][k]+sqrt(((a[k]+a[j])*(a[k]+a[j])-(a[k]-a[j])*(a[k]-a[j]))));
				}
			}
		}
		double ans=INF;
		for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]+a[i]);
		if(ans<=sum)cout << "OK" << endl;
		else cout << "NA" << endl;
	}
	return 0;
}