#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl cout<<"\n";
#define sp cout<<" ";
#define sz(x) x.size()
#define NumOfDigit(w) log10(w) + 1
#define MOD 1'000'000'007
#define inf 2'000'000'000
#define PI 3.141592654
#define modulo(a, b, mod) ((((a) % (mod)) + ((b) % (mod))) % (mod))
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
using namespace std;
void zainab_hamdy(){
  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
 //freopen("collisions.in" , "r" ,stdin);
  #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
 #endif

}
bool prime(ll n){
  if(n==2 || n==3) return true;
  if(n<2 || n%2==0  ) return false;
  for(int i=3;i<=sqrt(n);i+=2)   if(n%i==0) return false;
  return true;
}

int main(){
zainab_hamdy();

int t; cin >> t;
while(t--){

    ull num; cin >> num;

    for(ull i=num ;  ; i++){
        ull n=i;
         bool bl=0;
        string s=to_string(n);

        for(int j=0;j<sz(s)  ;j++){
            if(s[j]!='0' &&  n % (s[j]-'0')!=0){
                bl=1;
                break;
            }
        }
        if(bl==0){
            cout << n <<"\n";
            break;
        }
    }
}

 return 0;
}