#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 2147483647
const ll INF = 0x3f3f3f3f3f3f3f3fll;
#define ri register int
template <class T> inline T min(T a, T b, T c)
{return min(min(a, b), c);
}
template <class T> inline T max(T a, T b, T c)
{return max(max(a, b), c);
}
template <class T> inline T min(T a, T b, T c, T d)
{return min(min(a, b), min(c, d));
}
template <class T> inline T max(T a, T b, T c, T d)
{return max(max(a, b), max(c, d));
}
#define scanf1(x) scanf("%d", &x)
#define scanf2(x, y) scanf("%d%d", &x, &y)
#define scanf3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define scanf4(x, y, z, X) scanf("%d%d%d%d", &x, &y, &z, &X)
#define pi acos(-1)
#define me(x, y) memset(x, y, sizeof(x));
#define For(i, a, b) for (int i = a; i <= b; i++)
#define FFor(i, a, b) for (int i = a; i >= b; i--)
#define bug printf("***********\n");
#define mp make_pair
#define pb push_back
const int maxn = 10005;
// name*******************************
int f[33000][10];
int t;
int n=32768;
int ans=0;
// function******************************//***************************************
int main()
{
//    ios::sync_with_stdio(0);
//    cin.tie(0);
//    freopen("test.txt", "r", stdin);//  freopen("outout.txt","w",stdout);me(f,0);f[0][0]=1;for(int i=1; i*i<=n; i++)for(int j=i*i; j<=n; j++)for(int k=1; k<=4; k++)f[j][k]+=f[j-i*i][k-1];cin>>t;while(t--){ans=0;cin>>n;For(i,1,4)ans+=f[n][i];cout<<ans<<endl;}return 0;
}