代码，求调：

#include<bits/stdc++.h>
using namespace std;
long long n,i,j,a,q[20];
int main()
{
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>a;
		int beautiful_green=a;
		int lq=0;
		while(beautiful_green)
		{
			q[++lq]=beautiful_green%10;
			beautiful_green/=10;
		}
		for(j=1;j<=lq;j+=1)
		{
			if(q[j]%2==1)
			{
				q[j]*=7;
				while(q[j]>=10)
				{
					long long ugly_green=q[j];
					long long sum=0;
					while(ugly_green)
					{
						sum+=ugly_green%10;
						ugly_green/=10;
					}
					q[j]=sum;
				}
			}
		}
		long long sum_q=0;
		for(j=1;j<=lq;j++)
		{
			sum_q+=q[j];
		}
		if(sum_q%8==0)
		{
			cout<<"T\n";
		}
		else
		{
			cout<<"F\n";
		}
	}
}