#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



const double INF = 1LL<<60;
double dp[100000][15];

string str;

int main() {
    //freopen( "/Users/macuser/Dropbox/Contest/input.in", "r", stdin );
    while (getline(cin, str)) {
        istringstream sin(str);
        int L; sin >> L;
        double d;
        vector<double> vec;
        while (sin >> d) vec.PB(d);

        int n = vec.size();
        for (int i = 0; i < (1<<n); ++i) for (int j = 0; j < n; ++j) dp[i][j] = INF;
        for (int i = 0; i < n; ++i) dp[(1<<i)][i] = vec[i];
        for (int bit = 0; bit < (1<<n); ++bit) {
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    int nbit = bit | (1<<j);
                    
                    chmin(dp[nbit][j], dp[bit][i] + 2.0*sqrt( vec[i] * vec[j] ) );
                }
            }
        }
        double res = INF;
        for (int i = 0; i < n; ++i) chmin(res, dp[(1<<n)-1][i] + vec[i]);
        
        if (res <= L) puts("OK");
        else puts("NA");
    }
    return 0;
}
