#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;

int main(){

	int n, cnt, r[12];
	double len;
	string str;
	stringstream ss;
	vector<int> vc;
	
	while(getline(cin, str)){
		cnt = 0;
		vc.clear();
		
		ss.clear();
		ss << str;
		ss >> n;
		while(ss >> r[cnt]){
			cnt++;
		}
		
		sort(r, r+cnt);
		
		for(int i=0; i <= cnt-i-1; i++){
			if(i != cnt-i-1){
				vc.push_back(r[i]);
				vc.push_back(r[cnt-i-1]);
			}
			else {
				vc.push_back(r[i]);
			}
		}
		
		len = vc[0];
		for(int i=1; i<vc.size(); i++){
			len += 2.0 * sqrt(vc[i-1] * vc[i]);
		}
		len += vc.back();

		if(len <= (double)n) cout << "OK" << endl;
		else cout << "NA" << endl;
	}

	return 0;

}