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.math.*;
  import java.util.*;
  
  public class A{
    static final int mod = 1000000007;
  
    static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
  
    static void parr(int []arr) throws Exception{
      for(int i : arr) System.out.print(i+" ");
      System.out.println();
    }
    static void parr(long []arr) throws Exception{
      for(long i : arr) System.out.print(i+" ");
      System.out.println();
    }
    static void parr(double []arr) throws Exception{
      for(double i : arr) System.out.print(i+" ");
      System.out.println();
    }
    static void parr(float []arr) throws Exception{
      for(float i : arr) System.out.print(i+" ");
      System.out.println();
    }
  
    static int inpi() throws Exception{
      return (int)(Integer.parseInt(br.readLine()));
    }
    static long inpl() throws Exception{
      return (long)Long.parseLong(br.readLine());
    }
    static double inpd() throws Exception{
      return (double)Double.parseDouble(br.readLine());
    }
    static float inpf() throws Exception{
      return (float)Float.parseFloat(br.readLine());
    }
  
    static int[] inpai() throws Exception{
      String ar[] = br.readLine().split(" ");
      int n = ar.length;
      int arr[] = new int[n];
      int k=0;
      for(String i : ar) arr[k++] = (int)(Integer.parseInt(i));
      return arr;
    }
  
    static double[] inpad() throws Exception{
      String ar[] = br.readLine().split(" ");
      int n = ar.length;
      double arr[] = new double[n];
      int k=0;
      for(String i : ar) arr[k++] = (double)(Double.parseDouble(i));
      return arr;
    }
  
    static float[] inpaf() throws Exception{
      String ar[] = br.readLine().split(" ");
            int n = ar.length;
      float arr[] = new float[n];
      int k=0;
      for(String i : ar) arr[k++] = (float)(Float.parseFloat(i));
      return arr;
    }
  
    static long[] inpal() throws Exception{
      String ar[] = br.readLine().split(" ");
            int n = ar.length;
      long arr[] = new long[n];
      int k=0;
      for(String i : ar) arr[k++] = (long)(Long.parseLong(i));
      return arr;
    }
  ///////
  
  ///////////
  static void factors(long num){
  
    long sqrt = (long)Math.sqrt(num);
  //  System.out.println(num);
    for(long i=1;i<=sqrt;i++){
      if(num%i==0){
  
      }
    }
  }
  /////////////
  static int gcd (int a,int b){
  if(b==0) return a;
  return gcd(b,a%b);
  }
  //////
  
  static class sort implements Comparator<String>{
  public int compare(String a,String b){
    if(a.length()==b.length())return (int)(a.compareTo(b));
    return (int)(a.length()-b.length());
  }
  }
  
  
  static class node{
      int x,y;
      node(int x,int y){
        this.x = x;
        this.y = y;
      //  this.dis = dis;
      }
  }
  //////
  
  //////
  
  static long dp[][][];
  static int par[],level[];
  static char[] str;
  static boolean vis[];
  static Map<Integer,List<Integer>> map;
  static int a,b,tempochk;
  static Set<Integer> set;
  static int n,k,m,x,y;
  static int seg[],s;
  static ArrayList<Long> lis;
  static int arr[],brr[];
  /////
    public static void main(String[] args)throws Exception{
      int t=1;
      t = inpi();
  //    t=1;
  
      for(int z=1;z<=t;z++){
        long n = inpl();
  
        long c = (n/10+1)*10;
      //  System.out.println(c);
        if(n==c-1) System.out.println(1+n/10);
          else System.out.println(n/10);
      }
  //////
    }
  }
  