/*
  bit DP
    refer to http://d.hatena.ne.jp/iakasT/20091030/1256898765
*/

#include<cmath>
#include<cstdio>
#include<algorithm>

using namespace std;

int r[12],n;
double memo[1<<12][12];

double solve(int stat,int last)
{
	if(memo[stat][last]>1e-6)	return memo[stat][last];

	if(stat==0)	return memo[stat][last]=r[last];

	double wmin=10000;
	for(int i=0;i<n;i++){
		if((stat&(1<<i))==0)	continue;
		stat&=~(1<<i);
		wmin=min(wmin,2*sqrt(r[last]*r[i])+solve(stat,i));
		stat|=(1<<i);
	}
	return memo[stat][last]=wmin;
}

int main()
{
	int box;

	while(~scanf("%d ",&box)){
		for(n=1;;n++){
			scanf("%d",r+n-1);
			if(getchar()=='\n')	break;
		}

		for(int i=0;i<n;i++)
			for(int j=0;j<(1<<n);j++)
				memo[j][i]=0;

		double ans=10000;
		for(int i=0;i<n;i++){
			int stat=((1<<n)-1)&~(1<<i);
			ans=min(ans,r[i]+solve(stat,i));
		}
		puts(ans<=box?"OK":"NA");
	}

	return 0;
}