import sys
input = lambda : sys.stdin.readline().strip()
'''
╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬
╬╬ ▓▓ ▓▓ ╬╬
╬╬ ▓▓ ▓▓ ╬╬
╬╬ ▓▓█████▓▓ ╬╬
╬╬ ▓▓ ▓▓ ╬╬
╬╬ ▓▓ ▓▓ ╬╬
╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬
'''
for i in range(int(input())):
n = input()
x = len(n)
y = (x-1)*9
new_num = int("1"*x)
z = int(n)//new_num
print(z+y)#include<bits/stdc++.h>
using namespace std;
void solve(){
long long n;
cin>>n;
long long num=n;
int cnt=0;
long long dig=0;
while(n>0){
dig=n%10;
n=n/10;
cnt++;
}
long long digit=dig;
long long ans=0;
if(cnt==1){
cout<<dig<<endl;
return;
}
int count=cnt;
while(cnt>1){
dig=dig*10+digit;
cnt--;
}
if(num>=dig ){
ans=9*(count-1)+digit;
cout<<ans<<endl;
return;
}
else {
ans=9*(count-1)+digit-1;
cout<<ans<<endl;
return;
}
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |