高精度模板（From JCVB）

 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<iostream>
 #include<cstdlib>
 #include<cmath>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<bitset>
 #define cl(a) memset(a,0,sizeof(a))
 using namespace std;
 typedef long long ll;
 typedef double db;
 const db pi=3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
 void gn(int &x){
     int sg=;char c;while(((c=getchar())<''||c>'')&&c!='-');
     if(c=='-')sg=-,x=;else x=c-'';
     while((c=getchar())>=''&&c<='')x=x*+c-'';
     x*=sg;
 }
 void gn(ll &x){
     int sg=;char c;while(((c=getchar())<''||c>'')&&c!='-');
     if(c=='-')sg=-,x=;else x=c-'';
     while((c=getchar())>=''&&c<='')x=x*+c-'';
     x*=sg;
 }
 int mo=;
 int inf=;
 db eps=1e-;
 //ll inf=1000000000000000000ll;
 int qp(int a,ll b){int ans=;do{if(b&)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=);return ans;}
 int gcd(int a,int b){return b?gcd(b,a%b):a;}
 int dx[]={,,-,};
 int dy[]={,,,-};
 #define x1 x192837465
 #define x2 x123456789
 #define y1 y192837465
 #define y2 y123456789

 #include<cstdio>
 #include<vector>
 #include<algorithm>
 using namespace std;

 // upd 2015.11.28
 class Bignum{
     private:
         vector<int>a;
         void clear(){a.resize();a[]=;}
         void set(int n){
             if(clear(),n){
                 int t;a.clear();
                 while(n)a.push_back(n-(t=n/)*),n=t;
             }
         }
         void set(long long n){
             if(clear(),n){
                 long long t;a.clear();
                 while(n)a.push_back(n-(t=n/)*),n=t;
             }
         }
         void clearzero(){
             int l=a.size();
             while(l> && a[l-]==)l--;
             a.resize(l);
         }
         void set(char*st){
             char c;vector<int> s;a.clear();
             while(((c=*(st++))<'' || c>''));s.push_back(c-'');
             while((c=*(st++))>=''&&c<='')s.push_back(c-'');
             int l=s.size();
             for (int i=l-;i->=;i-=)a.push_back(s[i]+s[i-]*+s[i-]*+s[i-]*);
             if(l&){
                 int tmp=;
                 for (int i=;i<(l&);i++)tmp=tmp*+s[i];
                 a.push_back(tmp);
             }
             clearzero();
         }
     public:
         Bignum(){clear();}
         Bignum(int n){set(n);}
         Bignum(long long n){set(n);}
         Bignum(char*s){set(s);}
         Bignum& operator=(int a){set(a);return *this;}
         Bignum& operator=(long long a){set(a);return *this;}
         Bignum& operator=(char *s){set(s);return *this;}
         int size()const{
             if(a.back()>=)return a.size()<<;
             else if(a.back()>=)return (a.size()<<)-;
             else if(a.back()>=)return (a.size()<<)-;
             else return (a.size()<<)-;
         }
         long long toint()const{
             long long ans=;
             for (int i=int(a.size())-;i>=;i--)ans=ans*+a[i];
             return ans;
         }
         int tostr(char *s)const{
             int tot=;
             for (unsigned int i=;i<a.size();i++)
                 if(i+==a.size()){
                     int x=a[i];
                     while(x)s[tot++]=''+x%,x/=;
                 }else{
                     int x=a[i];
                     for (int j=;j<;j++)s[tot++]=''+x%,x/=;
                 }
             if(tot==)s[tot++]='';
             for (int i=,j=tot-;i<j;i++,j--)swap(s[i],s[j]);
             s[tot]=;
             return tot;
         }
         int toarr(int *s)const{
             int tot=;
             for (unsigned int i=;i<a.size();i++)
                 if(i+==a.size()){
                     int x=a[i];
                     while(x)s[tot++]=x%,x/=;
                 }else{
                     int x=a[i];
                     for (int j=;j<;j++)s[tot++]=x%,x/=;
                 }
             if(tot==)s[tot++]=;
             return tot;
         }
         int comp(const Bignum&x)const{
             if(a.size()<x.a.size())return ;
             if(a.size()>x.a.size())return -;
             for (int i=a.size()-;i>=;i--)
                 if(a[i]<x.a[i])return ;
                 else if(a[i]>x.a[i])return -;
             return ;
         }
         bool operator<(const Bignum&x)const{return comp(x)==;}
         bool operator>(const Bignum&x)const{return comp(x)==-;}
         bool operator<=(const Bignum&x)const{return comp(x)!=-;}
         bool operator>=(const Bignum&x)const{return comp(x)!=;}
         bool operator!=(const Bignum&x)const{return comp(x)!=;}
         bool operator==(const Bignum&x)const{return comp(x)==;}
         Bignum& operator+=(const Bignum&x){
             int l=max(a.size(),x.a.size())+;
             a.resize(l);
             for (unsigned int i=;i<x.a.size();i++)a[i]+=x.a[i];
             for (int i=;i<l;i++)if(a[i]>=)a[i]-=,a[i+]++;
             clearzero();return *this;
         }
         Bignum& operator-=(const Bignum&x){
             for (unsigned int i=;i<x.a.size();i++)a[i]-=x.a[i];
             for (unsigned int i=;i<a.size();i++)if(a[i]<)a[i]+=,a[i+]--;
             clearzero();return *this;
         }
         Bignum operator+(const Bignum&x)const{Bignum y=*this;y+=x;return y;}
         Bignum operator-(const Bignum&x)const{Bignum y=*this;y-=x;return y;}
         Bignum operator*(const Bignum&x)const{
             int l=a.size()+x.a.size();
             Bignum z;z.a.clear();
             vector<long long>tmp;tmp.resize(l);
             for (unsigned int i=;i<x.a.size();i++)
                 for (unsigned int j=;j<a.size();j++)
                     tmp[i+j]+=x.a[i]*a[j];
             for (int i=;i<l;i++){
                 long long t=tmp[i]/;
                 z.a.push_back(int(tmp[i]-t*));
                 t?tmp[i+]+=t:;
             }
             z.clearzero();return z;
         }
         Bignum operator*(long long x)const{
             if(x>=)return *this * Bignum(x);
             int l=a.size()+;
             Bignum z;z.a.resize(l);
             for (unsigned int i=;i<a.size();i++)z.a[i]=a[i]*x;
             for (int i=,t;i<l;i++)z.a[i+]+=(t=z.a[i]/),z.a[i]-=t*;
             z.clearzero();return z;
         }
         friend Bignum operator*(long long x,const Bignum&a){return a*x;}
         Bignum& operator*=(long long x){return *this=*this*x;}
         Bignum& operator*=(const Bignum&x){return *this=*this*x;}
         Bignum operator/(const Bignum &x)const{
             Bignum b=*this,q,tmp;q.a.resize(b.a.size());
             for(int i=int(b.a.size())-int(x.a.size());b>=x;i--,b.clearzero()){
                 tmp.a.assign(b.a.begin()+i,b.a.end());
                 int l=,r=-,m;
                 while(l<=r){
                     m=(l+r)>>;
                     if(x*m<=tmp)l=m+;
                     else r=m-;
                 }
                 for (unsigned int j=;j<tmp.a.size();j++)b.a[j+i]=;
                 q.a[i]=r;tmp-=x*r;
                 for (unsigned int j=;j<tmp.a.size();j++)b.a[j+i]=tmp.a[j];
             }
             q.clearzero();return q;
         }
         Bignum operator%(const Bignum &x)const{return *this-*this/x*x;}
         Bignum& operator/=(const Bignum &x){return *this=*this/x;}
         Bignum& operator%=(const Bignum &x){return *this=*this%x;}

         Bignum& operator/=(long long x){
             if(x>=)return *this/=Bignum(x);
             else{
                 for (int i=int(a.size())-;i>=;i--){
                     int t=a[i]/x;
                     if(i)a[i-]+=(a[i]-t*x)*;
                     a[i]=t;
                 }
                 clearzero();
                 return *this;
             }
         }
         Bignum operator/(long long x)const{
             if(x>=)return *this / Bignum(x);
             else{
                 Bignum y=*this;y/=x;return y;
             }
         }
         long long operator%(long long x)const{
             if(x>=)return (*this%Bignum(x)).toint();
             else{
                 long long ans=;
                 for (int i=int(a.size())-;i>=;i--)ans=(ans*+a[i])%x;
                 return ans;
             }
         }
         int operator%(int x)const{
             return int(operator%((long long)x));
         }
         Bignum& operator%=(long long x){
             if(x>=)return *this%=Bignum(x);
             else return *this=*this%x;
         }
         int to2(int *s)const{
             int tot=;
             vector<unsigned long long>t;
             for (unsigned int i=;i<a.size();i++)t.push_back((unsigned long long)a[i]);
             while(!t.empty()){
                 for (int i=int(t.size())-;i>=;i--){
                     unsigned long long r=t[i]>>;
                     if(i==){
                         s[tot++]=int(t[i]&0xffffffff);
                     }else{
                         t[i-]+=(t[i]&((unsigned long long)0xffffffff))*;
                     }
                     t[i]=r;
                 }
                 while(!t.empty() && t.back()==)t.pop_back();
             }
             return tot;
         }
         bool input(){
             char c;vector<int> s;a.clear();
             while(((c=getchar())<'' || c>'') && c!=EOF);
             if(c==EOF){a.push_back();return ;}
             s.push_back(c-'');
             while((c=getchar())>=''&&c<='')s.push_back(c-'');
             int l=s.size();
             for (int i=l-;i->=;i-=)a.push_back(s[i]+s[i-]*+s[i-]*+s[i-]*);
             if(l&){
                 int tmp=;
                 for (int i=;i<(l&);i++)tmp=tmp*+s[i];
                 a.push_back(tmp);
             }
             clearzero();
             return ;
         }
         void output()const{
             for (int i=int(a.size())-;i>=;i--)
                 if(i==int(a.size())-)printf("%d",a[i]);
                 else printf("%04d",a[i]);
         }
         void outputln()const{
             output();putchar('\n');
         }
         friend Bignum max(const Bignum &a,const Bignum &b){return a>b?a:b;}
         friend Bignum min(const Bignum &a,const Bignum &b){return a<b?a:b;}
 };
 Bignum a,N;
 int  main()
 {
     int tes;gn(tes);
     while(tes--){
         int n;gn(n);
         if(n<=){
             printf("%d\n",n*(n-)*(n-)*(n-)/+n);
         }else{
             N=n;
             a=N*(N-)*(N-)*(N-)/+N;
             a.outputln();
         }
         }
         return ;
         }