#include<bits/stdc++.h>

#define maxs(i, j) (i = max(i, j))
#define mins(i, j) (i = min(i, j))
#define ff first
#define ss second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()

#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))

#define PHB push_back
#define PHF push_front
#define PPB pop_back
#define PPF pop_front

#define is0(k) if(k == 0)
#define fastio ios::sync_with_stdio(0);cin.tie(0);

#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define yespy srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ln "\n"
#define nwln cout<<ln;
#define v(T) vector<T>
#define vv(T) v(v(T))

using namespace std;

typedef double dbl;
typedef bool oo;
typedef float flt;
typedef long long int ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vri;
typedef vector<vri> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pi> vpi;
typedef vector<bool> voo;

inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}

const dbl eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

int t, n;

int main()
{
    fastio
    
    cin>>t;
    int d[] = {1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111};
    
    while(t--) {
        cin>>n;

        short ok = 1, dig = 1;
        int cnt = 0;
        ll N = 1;
        
        while(N <= n) {
            if (dig != 9) {
                N += d[ok-1];
                dig++;
                cnt++;
            } else {
                N += (N/9) + 1;
                ok++;
                dig = 1;
                cnt++;
            }
        }
        
        cout<<cnt<<ln;
    }
    
    return 0;
}
