#include <cstdio>
#include <vector>
#include <deque>
#include <cmath>
#include <algorithm>

using namespace std;

int main(void) {
    int size;
    while (scanf("%d", &size) != EOF) {
        deque<int> r;
        char c;
        int x;
        while (1) {
            scanf("%d%c", &x, &c);
            r.push_back(x);
            if (c == '\n') break;
        }
        sort(r.begin(), r.end());
        bool f = true;
        vector<int> r2;
        while (!r.empty()) {
            if (f) {
                r2.push_back(r.front());
                r.pop_front();
            } else {
                r2.push_back(r.back());
                r.pop_back();
            }
            f = !f;
        }
        double t = 0.0;
        for (int i = 0; i < r2.size(); i++) {
            if (i == 0 || i == r2.size() - 1) {
                t += (double)r2[i];
            }
            if (i > 0) {
                t += 2 * sqrt((double)r2[i] * r2[i - 1]);
            }
        }
        if (t <= (double)size) {
            printf("OK\n");
        } else {
            printf("NA\n");
        }
    }
    return 0;
}