# 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 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; 
double calc(vector<double> a)
{
	double ans = 0;
	for (int i = 0; i < a.size()-1; i++)
	{
		double t = a[i] + a[i + 1];
		double r = abs(a[i] - a[i + 1]);
		ans += sqrt(t*t - r*r);
	}
	ans += a.front()+a.back();
	return ans;
}

int main()
{
	string s;
	while (getline(cin,s))
	{
		stringstream ss(s);
		double n;
		vector<double>a,A;
		ss >> n;
		double temp;
		while (ss >> temp)
		{
			a.push_back(temp);
		}
		bool ok = false;
		sort(all(a));
		A = a;
		vector<double> b,c;
		int iii = 0;
		while (a.size())
		{
			auto it = (iii ? a.begin() : a.end() - 1);
			b.push_back(*it);
			a.erase(it);
			iii++;
			iii %= 2;
		}
		a = A;
		iii = 1;
		while (a.size())
		{
			auto it = (iii ? a.begin() : a.end() - 1);
			c.push_back(*it);
			a.erase(it);
			iii++;
			iii %= 2;
		}
		double ans = min(calc(b), calc(c));
		ok = (ans <= n);

		if (ok)cout << "OK" << endl;
		else cout << "NA" << endl;

	}
}