//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include using namespace std; using ll = long long; using ull = unsigned long long; using db = double; using ld = long double; template using V = vector; template using VV = vector>; #define fs first #define sc second #define pb push_back #define mp make_pair #define mt make_tuple #define eb emplace_back #define lb lower_bound #define ub upper_bound #define all(v) (v).begin(),(v).end() #define siz(v) (ll)(v).size() #define rep(i,a,n) for(ll i=a;i<(ll)(n);++i) #define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i) #define ENDL '\n' typedef pair Pi; typedef pair PL; constexpr ll mod = 1000000007; // 998244353; constexpr ll INF = 1000000099; constexpr ll LINF = (ll)(1e18 +99); const ld PI = acos((ld)-1); const vector dx={-1,0,1,0},dy={0,1,0,-1}; template inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;} template inline bool chmax(T& t, const U& u){if(t inline T gcd(T a,T b){return b?gcd(b,a%b):a;} inline void yes() { cout << "Yes" << ENDL; } inline void no() { cout << "No" << ENDL; } template inline T mpow(T a, Y n) { T res = 1; for(;n;n>>=1) { if (n & 1) res = res * a; a = a * a; } return res; } template V prefix_sum(const V& v) { int n = v.size(); V ret(n + 1); rep(i, 0, n) ret[i + 1] = ret[i] + v[i]; return ret; } template istream& operator >> (istream& is, vector& vec){ for(auto&& x: vec) is >> x; return is; } template ostream& operator<<(ostream& os,const pair& p){ return os<<"{"< ostream& operator<<(ostream& os,const V& v){ os<<"{"; for(auto e:v)os< void debug(Args&... args){ for(auto const& x:{args...}){ cerr<>n; V d(n);cin>>d; rep(i,0,n){ string ans="9"; rep(j,0,d[i]-1)ans+="0"; cout<