#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);

		int xr[12];
		for(int i=0;i<=n/2;i++){
			xr[2*i+0]=r[i];
			xr[2*i+1]=r[n-1-i];
		}

		double w=xr[0]+xr[n-1];
		for(int i=0;i<n-1;i++)	w+=2*sqrt(xr[i]*xr[i+1]);
		puts(w<=box?"OK":"NA");
	}

	return 0;
}