#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

// strをdelimiterで分割する
vector<string> split(const string &str, const string &delimiter) {
    vector<string> res;
    size_t current = 0, found, delimlen = delimiter.size();
    while ((found = str.find(delimiter, current)) != string::npos) {
        res.emplace_back(string(str, current, found - current));
        current = found + delimlen;
    }
    res.emplace_back(string(str, current, str.size() - current));
    return res;
}

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

	string s;
	while (getline(cin, s)) {
	    vector<string> raw = split(s, " ");
	    int W;
	    vector<int> v;
	    W = stoi(raw[0]);
	    FOR(i, 1, raw.size()) {
	        v.emplace_back(stoi(raw[i]));
	    }
	    int n = v.size();

	    vector<vector<double>> dp(1 << n, vector<double>(n, INF));
	    FOR(i, 0, n) {
	        dp[1 << i][i] = v[i];
	    }

	    FOR(b, 0, 1 << n) {
	        FOR(i, 0, n) {
//                assert(dp[b][i] != INF);

                FOR(j, 0, n) {
                    if ((b & (1 << j)) == 0) {

                        int r1 = v[i];
                        int r2 = v[j];

                        double bb = (r1 + r2) * (r1 + r2) - (r1 - r2) * (r1 - r2);
                        double dist = sqrt(bb);
                        dp[b | 1 << j][j] = min(dp[b | 1 << j][j], dp[b][i] + dist);
                    }
                }
            }
	    }

	    bool ans = false;
	    FOR(j, 0, dp[0].size()) {
	        if (dp[(1 << n) - 1][j] + v[j] <= W) {
	            ans = true;
	        }
	    }
	    if (ans) {
	        print("OK");
	    }
	    else {
            print("NA");
        }
	}

	return 0;
}


Measured memory_bytes: 3348