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.util.*;
  import java.io.*;
  import static java.lang.System.out;
  import java.util.Stack;
  import java.util.Queue;
  
  public class A1553
  {
  
      static int mod=(int)(1e9+7);
      static long MOD=(long)(1e9+7);
      static FastReader in=new FastReader();
      static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
          
      public static void main(String args[])
      {  
  
          int tc=1;
       
          tc=in.nextInt();
          tcloop: while(tc-->0)
          {
  			
  			long n=in.nextLong();
  			
  			long last=n%10;
  			
  			if(last==9)
  			{
  				pr.println((n/10)+1);
  			}
  			else
  			{
  				pr.println(n/10);
  			}
  			
              
  
  
          }
          pr.flush();
          
      }
  
  
      
  
      static void sort(long[] a) {
  		ArrayList<Long> l = new ArrayList<>();
  		for (long i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
      
      
  	static void sort(int[] a) {
  		ArrayList<Integer> l = new ArrayList<>();
  		for (int i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
      }
  
      
      static class FastReader
      { 
          BufferedReader br; 
          StringTokenizer st; 
  
          public FastReader() 
          { 
              br = new BufferedReader(new InputStreamReader(System.in)); 
          } 
  
          String next() 
          { 
              while (st == null || !st.hasMoreElements()) 
              { 
                  try
                  { 
                      st = new StringTokenizer(br.readLine()); 
                  } 
                  catch (IOException  e) 
                  { 
                      e.printStackTrace(); 
                  } 
              } 
              return st.nextToken(); 
          } 
  
          int nextInt() 
          { 
              return Integer.parseInt(next()); 
          } 
  
          long nextLong() 
          { 
              return Long.parseLong(next()); 
          } 
  
          double nextDouble() 
          { 
              return Double.parseDouble(next()); 
          } 
          
          int[] readIntArray(int n)
          {
  		int a[]=new int[n];
  		for(int i=0;i<n;i++)a[i]=nextInt();
  		return a;
  	}
  		
  	long[] readLongArray(int n)
  	{
  		long a[]=new long[n];
  		for(int i=0;i<n;i++)a[i]=nextLong();
  		return a;
  	}
  	
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
      } 
  }
  
  
  
  