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

using namespace std;

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

		sort(r,r+n);

		double w,wmin=2*box;
		do{
			w=r[0]+r[n-1];
			for(int i=0;i<n-1;i++)	w+=2*sqrt(r[i]*r[i+1]);
			wmin=min(wmin,w);
		}while(next_permutation(r,r+n));

		puts(wmin<=box?"OK":"NA");
	}

	return 0;
}