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


double dp[1<<12][12];

int main(){
	string s;
	int size;
	int r[12];
	int n;
	while(getline(cin,s)){
		stringstream ss(s);
		ss>>size;
		n=0;
		while(ss>>r[n])n++;
		for(int i=0;i<(1<<n);i++)for(int j=0;j<n;j++)dp[i][j]=1e10;
		for(int j=0;j<n;j++)dp[1<<j][j]=r[j];
		for(int i=0;i<(1<<n);i++){
			for(int j=0;j<n;j++){
				if(!(i>>j&1))continue;
				for(int k=0;k<n;k++){
					if(i>>k&1)continue;
					dp[i|1<<k][k]=min(dp[i|1<<k][k],dp[i][j]+2*sqrt(r[j]*r[k]));
				}
			}
		}
		bool ok=false;
		for(int j=0;j<n;j++){
			if(dp[(1<<n)-1][j]+r[j]<=size)ok=true;
		}
		cout<<(ok?"OK":"NA")<<endl;
	}
	return 0;
}