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.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<ll, ll>;
using vpii = vector<pii>;
using vint = vector<ll>;
using ar3 = array<ll, 3>;
using ar4 = array<ll, 4>;
using va3 = vector<ar3>;
using va4 = vector<ar4>;
const ll N = 2e5 + 5;
const ll Inf = 1e9 + 7;
const ll inf = 1e18 + 7;
ll n, m;
void solve() {
  cin >> n;
  cout << (n + 1) / 10 << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout << setprecision(9) << fixed;
  ll tt = 1;
  cin >> tt;
  while (tt--) {
    solve();
  }
}
