PE?

#include <iostream>
#include <algorithm>
#define int long long
using namespace std;

int n;
int* func() {
    for (int i = 0; i * i <= n; i++) {
        for (int j = 0; j * j <= n; j++) {
            for (int k = 0; k * k <= n; k++) {
                int l = n - i * i - j * j - k * k;
                if (i * i + j * j + k * k + l * l == n) {
                    int* a = new int[4]; 
                    a[0] = i;
                    a[1] = j;
                    a[2] = k; 
                    a[3] = l;
                    return a;
                }
            }
        }
    }
    return nullptr; 
}

signed main() {
    cin >> n;
    int* a = func();
    if (a != nullptr) {
        sort(a, a + 4);
        for (int i = 0; i < 4; i++) cout << a[i] << " ";
        delete[] a; 
    } else {
        cout << "-1";
    }

    return 0;
}