TLE求调

#include<iostream>
using namespace std;
int main(){
    int a;
    cin>>a;
    int n[a];
    for(int i=0;i<a;i++){
        cin>>n[i];
        for(int j=0;j<n[i];j++){
            if(j*j*j*j==n[i]){
                cout<<j<<"\n";
                continue;
            }
            else if(j==n[i]-1&&j*j*j*j!=n[i]){
                cout<<"-1\n";
            }
        }
    }
    return 0;
}