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.System.*;
  import static java.lang.Math.*;
  public class CodechefCook
  {
      void run() {
          int tc=ni();
          StringBuilder sb = new StringBuilder();
          while(tc-->0) {
              int n=ni()+1;
              sb.append(n/10).append("\n");
          }
          out.println(sb);
          out.flush(); 
          out.close();
      }
  
      public static void main(String[] args)throws Exception {
          try { 
              // new Thread(null, new CodechefCook()::run, "1", 1 << 26).start();
              new Thread(null, new CodechefCook("ONLINE_JUDGE")::run, "1", 1 << 26).start();
          } catch(Exception e) {}
      }
  
      FastReader sc=null;PrintWriter out = null;
      public CodechefCook()throws Exception {
          sc = new FastReader(new FileInputStream("D:\\CP\\input.txt"));
          out = new PrintWriter(new BufferedWriter(new FileWriter("D:\\CP\\output.txt")));
      }
      public CodechefCook(String JUDGE) {
          sc = new FastReader(System.in);
          out = new PrintWriter(System.out);      
      }
      
      String ns() { return sc.next(); }
      int ni() { return sc.nextInt(); }
      long nl() { return sc.nextLong(); }
      int[] ni(int n) {
          int a[]=new int[n];
          for(int i=0;i<n;a[i++]=ni());
          return a;
      }
      long[] nl(int n) {
          long a[]=new long[n];
          for(int i=0;i<n;a[i++]=nl());
          return a;
      }
      
      int[][] ni(int n,int m) {
          int a[][]=new int[n][m];
          for(int i=0;i<n;i++) 
              for(int j=0;j<m;j++)
                  a[i][j]=ni();
          return a;
      }
      long[][] nl(int n,int m) {
          long a[][]=new long[n][m];
          for(int i=0;i<n;i++) 
              for(int j=0;j<m;j++)
                  a[i][j]=nl();
          return a;
      }
      int gcd(int a, int b) {
          return b==0?a:gcd(b,a%b);
      }
      static class FastReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private FastReader.SpaceCharFilter filter;
          public FastReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1) throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) return -1;
              }
              return buf[curChar++];
          }
  
          public int nextInt() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res * sgn;
          }
          
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              do {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res = res*1L*10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res *1L* sgn;
          }
          
          public String next() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
  
          }
      }
  }