int[] weakNumbers(int n) {
    int[] a = new int[1111];
    for (int i = 1; i < 1001; i++) {
        a[i] = foo(i);
    }
    int[] f = new int[1111];
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j < i; j++) {
            f[i] += (a[j] > a[i] ? 1 : 0);
        }
    }
    int q = 0;
    int w = 0;
    for (int i = 1; i <= n; i++) {
        System.out.print(f[i] + " ");
        if (f[i] > q) {
            q = f[i];
            w = 1;
        } else {
            if (f[i] == q) w++;
        }
    }
    return new int[]{q, w};

}

int foo(int x) {
    int y = 0;
    for (int i = 1; i <= x; i++) {
        if (x % i == 0) y++;

    }
    return y;
}