#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <bitset>
using namespace std;
  
const double EPS = 1e-9;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int main(){
	string s;
	while(getline(cin, s)){
		stringstream ss;
		vector<int> r;
		int boxlen;
		int n;
		ss << s;
		ss >> boxlen;
		while(ss >> n){
			r.push_back(n);
		}
		sort(r.begin(), r.end());
		double len = r[0];
		if(r.size() > 1){
			len += r[1];
		}
		int i = 0, j = r.size()-1;
		int cnt = 0;
		while(i != j){
			len += 2*sqrt((double)r[i]*r[j]);
			if(cnt%2){
				j--;
			}else{
				i++;
			}
			cnt++;
		}

		cout << "len:" << len << endl;
		cout << "boxlen:" << boxlen << endl;
		if(len <= boxlen){
			cout << "OK" << endl;
		}else{
			cout << "NA" << endl;
		}
	}

  
    return 0;
}