#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
#define ll long long
using namespace std;
const int inf=2e9+1e8;
const int T=100+1;
const int N=32768+5;


int dp[N][5];
int t,n;
int ans;
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=0;i<=n;i++){
			for(int j=0;j<=4;j++){
				dp[i][j]=0;
			}
		}
		
		dp[0][0]=1;
	
		for(int i=1;i<=n;i++){
			for(int j=1;j*j<=i;j++){
				for(int k=1;k<=4;k++){
					dp[i][k]+=dp[i-j*j][k-1];
				}
			}
		}
		
		ans=0;
		for(int i=1;i<=4;i++)ans+=dp[n][i];
		printf("%d",ans);		
	}
	return 0;
}