#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>
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-10;
const double PI  = acos(-1.0);

int main(){
	int l;
	string s;
	while(getline(cin,s)){
		istringstream iss(s);
		iss>>l;
		vi a;
		int aa;
		while(iss>>aa){
			a.push_back(aa);
		}

		bool ok=false;
		do{
			double len=a[0]+a[a.size()-1];
			REP(i,a.size()-1){
				len+=sqrt(a[i]*a[i+1])*2;
			}
			if(len<=l+EPS){
				ok=true;
			}
		}while(next_permutation(ALL(a)));

		cout<<(ok?"OK":"NA")<<endl;
	}
}