description: 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.
solution: import java.io.*;
  import java.util.*;
  
  import static java.lang.Math.max;
  
  public class A {
      Reader source;
      BufferedReader br;
      StringTokenizer in;
      PrintWriter out;
  
      public String nextToken() throws Exception {
          while (in == null || !in.hasMoreTokens()) {
              in = new StringTokenizer(br.readLine());
          }
          return in.nextToken();
      }
      public int nextInt() throws Exception {
          return Integer.parseInt(nextToken());
      }
      public long nextLong() throws Exception {
          return Long.parseLong(nextToken());
      }
      public double nextDouble() throws Exception {
          return Double.parseDouble(nextToken());
      }
      public void run() throws Exception {
          source = OJ ? new InputStreamReader(System.in) : new FileReader("A.in");
          br = new BufferedReader(source);
          out = new PrintWriter(System.out);
          solve();
          out.flush();
      }
      public void sort(int[] a) {
          ArrayList<Integer> list = new ArrayList<>();
          for (int i : a) list.add(i);
          Collections.sort(list);
          for (int i = 0; i < a.length; i++)
              a[i] = list.get(i);
      }
      public static void main(String[] args) throws Exception {
          new A().run();
      }
      private boolean OJ = System.getProperty("ONLINE_JUDGE") != null;
  
      public void solve() throws Exception {
          int t = nextInt();
          while (t-- > 0) {
              int n = nextInt();
              System.out.println((n + 1) / 10);
          }
      }
  }