#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

int gcd(int x, int y){
	if(y==0) return x;
	return gcd(y, x%y);
}

int lcm(int x, int y){
	return (x*y) / gcd(x,y);
}



int consistency(int n){
	
	for(int i=n; i<=n+3000; i++){
		vector<int> digits(10, 0);
		int x = i;
		while(x){
			int digit = x%10;
			if(digit>0) digits[digit]++;
			x /= 10;
		}
		
		bool isDiv = true;
		for(int j=1; j<10; j++){
			if(digits[j] == 0) continue;
			if(i%j != 0){
				isDiv = false;
				break;
			}
		}
		if(isDiv) return i;
	}
	
	return n;

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}