#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

double r[14];  // r[0]が箱の大きさ
int n;

int to_number(const string &s)
{
    int index = 0;

    for (int i = 0; i < s.size(); i++) {
        if ('0' <= s[i] && s[i] <= '9') {
            int tmp = s[i] - '0';

            while (i < s.size() && ('0' <= s[i + 1] && s[i + 1] <= '9')) {
                tmp *= 10;
                tmp += (s[++i] - '0');
            }
            r[index++] = tmp;
        }
    }
    return index;
}

int main()
{
    string s;

    while (getline(cin, s)) {
        bool flag = false;

        s += " ";
        n = to_number(s);

        do {
            double w = 0.0;

            for (int i = 1; i < n; i++)
                w +=  2.0 * sqrt((double)r[i] * r[i + 1]);
            w += r[1] + r[n - 1];

            if (w <= r[0]) {
                flag = true;
                break;
            }
        } while (next_permutation(r + 1, r + n));

        if (flag)
            cout << "OK\n";
        else
            cout << "NA\n";
    }

    return 0;
}