# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <map>
# include <stack>
using namespace std;
//# define M_PI 3.141592
# define INF ((int)(1<<30))
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define CHECK(i,a) FOR(i,a.size())cout<<#a<<"["<<i<<"] : "<<a[i]<<endl; 

vector<double>a;
double memo[1 << 12][13];
double calc(int a1,int a2)
{
	double t = a[a1] + a[a2];
	double s = a[a1] - a[a2];
	return sqrt(t*t - s*s);
}



double dp(int bit,int s)
{
	if (memo[bit][s]>=0)return memo[bit][s];
	double ans = 9999999999999.0;
	bool ok = true;
	for (int i = 0; i < a.size(); i++)
	{
		if (!(bit & (1 << i)))
		{
			ok = false;
			double x = (bit ? 0.0 : a[i]);
			ans = min(ans, dp(bit | (1 << i), i) + calc(i, s)+x);
		}
	}
	if (ok)return a[s];
	return memo[bit][s] = ans;
}
int main()
{
	string s;
	while (getline(cin,s))
	{
		for (auto &x : memo)for(auto &y:x)y= -1.0;
		a.clear();
		stringstream ss(s);
		double n;
		ss >> n;
		double temp;
		while (ss >> temp)
		{
			a.push_back(temp);
		}
		bool ok = false;
		double ans = 99999999999999999;
		for (int i = 0; i < a.size(); i++)
		{
			ans = min(ans, dp(1 << i, i)+a[i]);
		}
		ok = (ans <= n);
		if (ok)cout << "OK" << endl;
		else cout << "NA" << endl;

	}
}