Problem: There are n digital panels placed in a straight line. Each panel can show any digit from 0 to 9. Initially, all panels show 0.

Every second, the digit shown by each panel increases by 1. In other words, at the end of every second, a panel that showed 9 would now show 0, a panel that showed 0 would now show 1, a panel that showed 1 would now show 2, and so on.

When a panel is paused, the digit displayed on the panel does not change in the subsequent seconds.

You must pause exactly one of these panels, at any second you wish. Then, the panels adjacent to it get paused one second later, the panels adjacent to those get paused 2 seconds later, and so on. In other words, if you pause panel x, panel y (for all valid y) would be paused exactly |x−y| seconds later.

For example, suppose there are 4 panels, and the 3-rd panel is paused when the digit 9 is on it.

  * The panel 1 pauses 2 seconds later, so it has the digit 1; 
  * the panel 2 pauses 1 second later, so it has the digit 0; 
  * the panel 4 pauses 1 second later, so it has the digit 0. 



The resulting 4-digit number is 1090. Note that this example is not optimal for n = 4.

Once all panels have been paused, you write the digits displayed on them from left to right, to form an n digit number (it can consist of leading zeros). What is the largest possible number you can get? Initially, all panels show 0.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Each test case consists of a single line containing a single integer n (1 ≤ n ≤ 2⋅10^5).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅10^5.

Output

For each test case, print the largest number you can achieve, if you pause one panel optimally.

Example

Input


2
1
2


Output


9
98

Note

In the first test case, it is optimal to pause the first panel when the number 9 is displayed on it.

In the second test case, it is optimal to pause the second panel when the number 8 is displayed on it.

Solution (in JAVA):

Solution:






import java.io.*;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;


public class Main {

    static class Reader {
        static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        static StringTokenizer tokenizer = new StringTokenizer("");
        static String next() throws IOException {
            while ( ! tokenizer.hasMoreTokens() ) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
            return tokenizer.nextToken();
        }
        static int nextInt() throws IOException {
            return Integer.parseInt( next() );
        }
        static double nextDouble() throws IOException {
            return Double.parseDouble( next() );
        }
    }
    PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));

    void solve() throws IOException {
        int n = Reader.nextInt();
        int max = Math.min(9,n-1);
        String ans = "";
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i<=max/2+1; i++) {
            int base = 9-i;
            for(int j = 0; j<n ; j++) {
                int cur = (Math.abs(j-i) + base)%10;
                sb.append(cur);
            }
            if(ans.compareTo(sb.toString()) < 0) {
                ans = sb.toString();
            }
            sb.setLength(0);
        }
        writer.write(ans+"\n");
        writer.flush();
    }

    public static void main(String[] args) throws IOException {
        Main main = new Main();
        int t = Reader.nextInt();
        while (t-->0) {
            main.solve();
        }
    }
}








//class UnionFind {
//    int[] parents;
//    int[] sizes;
//    int count;
//
//    public UnionFind(int size) {
//        parents = new int[size];
//        for(int i = 0; i<size ; i++) {
//            parents[i] = i;
//        }
//        sizes = new int[size];
//        count = size;
//    }
//
//    public void union(int p, int q) {
//        int rootP = find(p);
//        int rootQ = find(q);
//        if(sizes[rootP]>sizes[rootQ]) {
//            parents[rootQ] = rootP;
//            sizes[rootP] += sizes[rootQ];
//        } else {
//            parents[rootQ] = parents[rootP];
//            sizes[rootP] += sizes[rootQ];
//        }
//        count--;
//    }
//
//    public int find(int x) {
//        if(parents[x]==x) {
//            return x;
//        }
//        return parents[x] = find(parents[x]);
//    }
//}