#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200005
#define pb push_back
#define ss second
#define ff first
#define sz size()
#define ios ios::sync_with_stdio(0);cin.tie(0);
ll a[N], t, T, n;
string s, g;
int main () {
//freopen("cowjog.in","r",stdin);
//freopen("cowjog.out","w",stdout);
ios
cin >> T;
while(T--) {
cin >> n;
s = "";
while(n-26 > 1) {
n -= 26;
s += 'z';
}
if(s.size() == 3){
cout<<s<<'\n';
continue;
}
if(s.size() > 1) {
s+=char(n+97-1);
sort(s.begin(),s.end());
cout<<s<<'\n';
continue;
}
if(s.size() == 0){
s="aa";
s+=char(97+(n-2)-1);
sort(s.begin(),s.end());
cout<<s<<'\n';
continue;
}
s += "a";
s += char(97+(n-1)-1);
sort(s.begin(),s.end());
cout<<s<<'\n';
}
}
768A - Oath of the Night's Watch | 156C - Cipher |
545D - Queue | 459B - Pashmak and Flowers |
1538A - Stone Game | 1454C - Sequence Transformation |
165B - Burning Midnight Oil | 17A - Noldbach problem |
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |
664A - Complicated GCD | 1635D - Infinite Set |
1462A - Favorite Sequence | 1445B - Elimination |
1656C - Make Equal With Mod | 567A - Lineland Mail |
1553A - Digits Sum | 1359B - New Theatre Square |
766A - Mahmoud and Longest Uncommon Subsequence | 701B - Cells Not Under Attack |
702A - Maximum Increase | 1656D - K-good |
1426A - Floor Number | 876A - Trip For Meal |