#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <sstream>
#include <queue>

using namespace std;

double const DOUBLE_MAX = 10000000;

double DP[12][10000];

// ?????????????????????????????§????????£???????????????
vector<string> split(const string &str, char sep)
{
    vector<string> v;
    stringstream ss(str);
    string buffer;
	
    while(getline(ss, buffer, sep)){
        v.push_back(buffer);
    }
	
    return v;
}

long long int int_str(string str){
	long long int num = 0;
	bool minus = false;
	if(str[0] == '-'){
		str = str.substr(1);
		minus = true;
	}
	for(int i = 0; i < str.size(); i++){
		num *= 10;
		num += (str[i] - '0');
	}
	if(minus){
		num = -num;
	}
	return num;
}

int main(){
	
	while(true){
		
		int w_max;
		
		cin >> w_max;
		
		if(cin.eof()){
			break;
		}
		
		cin.ignore();
		
		string str;
		
		getline(cin, str);
		
		vector<string> v_str = split(str, ' ');
		
		vector<int> v_num;
		
		for(int i = 0; i < v_str.size(); i++){
			v_num.push_back(int_str(v_str[i]));
		}
		
		double cost[15][15];
		
		int n = v_num.size();
		
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				cost[i][j] = sqrt((double)((v_num[i] + v_num[j]) * (v_num[i] + v_num[j]) - (v_num[i] - v_num[j]) * (v_num[i] - v_num[j])));
			}
		}
		
		for(int i = 0; i < 12; i++){
			for(int j = 0; j < 10000; j++){
				DP[i][j] = DOUBLE_MAX;
			}
		}
		
		for(int i = 0; i < (1 << n); i++){
			int hoge = i;
			int comp = 1;
			for(int j = 0; j < n; j++){
				if(hoge % 2 == 1){
					if(i - comp == 0){
						DP[j][i] = v_num[j];
					}else{
						int hoge2 = i - comp;
						for(int k = 0; k < n; k++){
							if(hoge2 % 2 == 1){
								DP[j][i] = min(DP[j][i], DP[k][i - comp] + cost[j][k]);
							}
							hoge2 /= 2;
						}
					}
				}
				hoge /= 2;
				comp *= 2;
			}
		}
		
		bool flag = false;
		
		for(int j = 0; j < n; j++){
			if(w_max >= DP[j][(1 << n) - 1] + v_num[j]){
				flag = true;
			}
		}
		
		if(flag){
			cout << "OK" << endl;
		}else{
			cout << "NA" << endl;
		}
	}
	return 0;
}