#include<bits/stdc++.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define DU double
#define rep(i,x,n) for(int i=(x);i<=(n);i++)
#define nep(i,x,n) for(int i=(x);i>=(n);i--)
using namespace std;
const int N=30;
ll n,cnt,a[N];
inline ll read(){
	ll s=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		s=(s<<3)+(s<<1)+(ch^48);
		ch=getchar();
	}
	return s*f;
}
inline void print(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9) print(x/10);
	putchar(x%10+'0');
}
inline void Solve(){
	n=read();cnt=0;
	while(n) a[++cnt]=n%10,n/=10;
	reverse(a+1,a+cnt+1);
	if(cnt==1){puts("11");return ;}
	bool _=0;
	rep(i,2,cnt){
		if(a[i]==a[2]) continue;
		if(a[i]<a[2]){_=1;break;}
		if(a[i]>a[2]) break;
	}
	if(!_){
		if(a[2]==9){
			if(a[1]==9){
				print(1);rep(i,1,cnt) print(1);
			}
			else{
				print(a[1]+1);rep(i,2,cnt) print(a[1]+1);
			}
		}
		else{
			print(a[1]);rep(i,2,cnt) print(max(a[1],a[2]+1));
		}
	}
	else{
		print(a[1]);rep(i,2,cnt) print(max(a[1],a[2]));
	}
	puts("");
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int Tests=read();
	while(Tests--) Solve();
	return 0;
}