Let's define S(x) to be the sum of digits of number x written in decimal system. For example, S(5) = 5, S(10) = 1, S(322) = 7.

We will call an integer x interesting if S(x + 1) < S(x). In each test you will be given one integer n. Your task is to calculate the number of integers x such that 1 ≤ x ≤ n and x is interesting.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — number of test cases.

Then t lines follow, the i-th line contains one integer n (1 ≤ n ≤ 10^9) for the i-th test case.

Output

Print t integers, the i-th should be the answer for the i-th test case.

Example

Input


5
1
9
10
34
880055535


Output


0
1
1
3
88005553

Note

The first interesting number is equal to 9.
/* ak 47s, mac 11's,glocks and 9's*/
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
 
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define iter(a, b, c) for(auto(a) = (b); (a) < (c); ++(a))
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
using namespace std;
using namespace __gnu_pbds; 
 
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pp;
typedef vector<pp> vpp;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef tree<int, null_type, less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
 
int fpower(int x, unsigned int y, int p)  
{  
    int res = 1; 
    x = x % p;
    if (x == 0) return 0;
    while (y > 0)  
    {  
        if (y & 1)  
            res = (res*x) % p;  
        y = y>>1;
        x = (x*x) % p;  
    }  
    return res;  
}  
 
int minimum(int x,int y){
    if(x<y)
        return x;
    else return y;
}
 
ll maximum(ll x,ll y){
    if(x>y)
        return x;
    else return y;
}
 
int gcd(int a, int b) 
{ 
    if (b == 0) 
        return a; 
    return gcd(b, a % b);  
      
} 
 
int lcm(int a,int b){
    return (a*b/gcd(a,b));
}
 
//----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
ll t,n,i;
int main(){
	fastio
	cin>>t;
	ll x;
	while(t--){
	    cin>>n;
	    if(n<9) cout<<0<<endl;
	    else if(n==9|| n==10) cout<<1<<endl;
	    else if(n>10) cout<<n/10<<endl;
	    
	}
}
