poj3077

//poj3077 我的方法很麻烦，看别人好简单。。
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
long long gen(int n)
{
	long long sum = 0;
	for(int i = 0; i < n; i++)
		sum += 5 *pow(10.0,i);
	return sum;
}
int main()
{
	long long a;
	int n;
	cin>>n;
	while(n--)
	{
		cin>>a;
		if(a <= 10)
			cout<<a<<endl;
		else
		{
			for(int j = 1; j < 9; j++)
			{
				for(int i = 1; i <= 9; i++)
				{
					if(i == 9)
					{
						if(a >= pow(10.0, j)*i && a <= pow(10.0, j+1) * 1)
						{
							if(a + gen(j) >= pow(10.0, j+1) * 1)
							{
								cout<<(long long)pow(10.0, j) * (i+1)<<endl;
								j = 9;
								break;
							}
							else
							{
								cout<<(long long)pow(10.0, j+1) * 1<<endl;
								j = 9;
								break;
							}	
						}
					}
					else
					{
						if(a >= pow(10.0, j)*i && a <= pow(10.0, j)*(i+1))
						{
							if(a + gen(j) >=  pow(10.0, j)*(i+1))
							{
								cout<<(long long)pow(10.0, j) * (i+1)<<endl;
							 	j= 9;
								break;
							}
							else
							{
								cout<<(long long)pow(10.0, j) * i<<endl;
								j = 9;
								break;
							}	
						}
					}	
					
				}
			}
		}
		
			
	} 
	return 0;
}