Conversion to the base 9 To remove all 4s

/**
 *    author:  compounding
 *    created: 2024-12-25 17:06:22
 **/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define NeedForSpeed                  \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define int long long
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vpi;
#define f first
#define s second
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define endl "\n"
const int mod = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int convertbase(int k, int base)
{
    string s = "";
    while (k > 0)
    {
        int digit = k % base;
        if (digit <= 3)
        {
            s += to_string(digit);
        }
        else
        {
            s += to_string(digit + 1);
        }
        k /= base;
    }
    reverse(all(s));
    return stoll(s);
}
void solve()
{
    // we dont want 4 so we convert k in the base 9
    int k;
    cin >> k;
    int ans = convertbase(k, 9);
    cout << ans << endl;
    return;
}

signed main()
{
    NeedForSpeed;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}