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>
int mymax(int a, int b) {
  if (a > b) return a;
  return b;
}
int mymin(int a, int b) {
  if (a < b) return a;
  return b;
}
void boost() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
}
int main(void) {
  int t;
  dup2(open("test.txt", O_RDONLY), 0);
  boost();
  std::cin >> t;
  for (int i = 0; i < t; i++) {
    int ans = 0, n;
    std::cin >> n;
    if (n == 9)
      ans += 1;
    else
      ans = n / 10;
    std::cout << ans << '\n';
  }
  return (0);
}
