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: //package codeforces;
  import java.io.PrintWriter;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.*;
  public class solution { 
      public static void main(String args[]) throws java.lang.Exception{ 
      	FastScanner s=new FastScanner();
  		PrintWriter out=new PrintWriter(System.out);
  		int t=s.nextInt();
  		for(int tt=0;tt<t;tt++) {
  			int n=s.nextInt();
  			if(n>=9) {
  				out.println((n+1)/10);
  			}else {
  				out.println(0);
  			}
  		}
  		out.close();
      }
      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 int gcd(int a, int b){
        if (b == 0)
          return a;
        return gcd(b, a % b);
      }
      static void sortcol(int a[][],int c) {
  		Arrays.sort(a, (x, y) -> {
  			if(x[c]>y[c]) {
  				return 1;
  			}else {
  				return -1;
  			}
  		});
  	}
      public static void printb(boolean ans) {
      	if(ans) {
      		System.out.println("Yes");
      	}else {
      		System.out.println("No");
      	}
      }
      static class FastScanner {
  		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st=new StringTokenizer("");
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st=new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
      static class Pair implements Comparable<Pair>{
      	int a , b; 
      	Pair(int x , int y){
      		a=x;
      		b=y;
      	}
      	public int compareTo(Pair o) {
      		return a != o.a ? a - o.a : b - o.b;
      	}
      }
  }