#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
char I[300],*p;
int R[15],B,N,i,f;
double l;
int main()
{
	for(;gets(I);)
	{
		p=strtok(I," ");
		B=atoi(p);
		for(N=0;(p=strtok(NULL," "))!=NULL;)
			R[N++]=atoi(p);
		f=0;
		do
		{
			l=0;
			for(i=0;i<N-1;i++)
			{
				int a=pow((double)R[i]+R[i+1],2);
				int b=pow((double)abs(R[i]-R[i+1]),2);

				l+=sqrt((double)(a-b));
			}
			if(B*B>=pow(l+R[0]+R[N-1],2))
			{
				f=1;
				break;
			}
		}while(next_permutation(R,R+N));
		puts(f?"OK":"NA");
	}
}