package main

import (
	"bufio"
	"fmt"
	"io"
	"math"
	"os"
	"sort"
	"strconv"
)

var iost *Iost

type Iost struct {
	Scanner *bufio.Scanner
	Writer  *bufio.Writer
}

func NewIost(fp io.Reader, wfp io.Writer) *Iost {
	const BufSize = 2000005
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, BufSize), BufSize)
	return &Iost{Scanner: scanner, Writer: bufio.NewWriter(wfp)}
}
func (i *Iost) Text() string {
	if !i.Scanner.Scan() {
		panic("scan failed")
	}
	return i.Scanner.Text()
}
func (i *Iost) Atoi(s string) int                 { x, _ := strconv.Atoi(s); return x }
func (i *Iost) GetNextInt() int                   { return i.Atoi(i.Text()) }
func (i *Iost) Atoi64(s string) int64             { x, _ := strconv.ParseInt(s, 10, 64); return x }
func (i *Iost) GetNextInt64() int64               { return i.Atoi64(i.Text()) }
func (i *Iost) Atof64(s string) float64           { x, _ := strconv.ParseFloat(s, 64); return x }
func (i *Iost) GetNextFloat64() float64           { return i.Atof64(i.Text()) }
func (i *Iost) Print(x ...interface{})            { fmt.Fprint(i.Writer, x...) }
func (i *Iost) Printf(s string, x ...interface{}) { fmt.Fprintf(i.Writer, s, x...) }
func (i *Iost) Println(x ...interface{})          { fmt.Fprintln(i.Writer, x...) }
func isLocal() bool                               { return os.Getenv("NICKEL") == "BACK" }
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	if isLocal() {
		fp, _ = os.Open(os.Getenv("WELL_EVERYBODY_LIES_TOO_MUCH"))
	}
	iost = NewIost(fp, wfp)
	defer func() {
		iost.Writer.Flush()
	}()
	solve()
}
func solve() {
	t := iost.GetNextInt()
	for i := 0; i < t; i++ {
		testcase()
	}
}
func testcase() {
	k := iost.GetNextInt()
	more := sort.Search(math.MaxInt64, func(x int) bool {
		return f(x) >= k
	})
	iost.Println(more)
}
func f(x int) int {
	if x < 100 {
		return 0
	}
	ans := 0
	xx := make([]int, 0)
	for x > 0 {
		xx = append(xx, x%10)
		x /= 10
	}
	l := 0
	n := len(xx)
	r := n - 1
	for l < r {
		xx[l], xx[r] = xx[r], xx[l]
		l++
		r--
	}
	dp := make([][2][10][10]int, n+1)
	dp[n][0][0][0] = 1
	for i := n - 1; i >= 0; i-- {
		used := n - 1 - i
		for j := 0; j < 2; j++ {
			for k := 0; k < 10; k++ {
				for l := 0; l < 10; l++ {
					for m := 0; m < 10; m++ {
						tj := 0
						if xx[i]-j < m {
							tj = 1
						}
						if used >= 2 && !g(m, k, l) {
							continue
						}
						dp[i][tj][m][k] += dp[i+1][j][k][l]
						if m == 0 || used < 2 {
							continue
						}
						if i > 0 || tj == 0 {
							ans += dp[i+1][j][k][l]
						}
					}
				}
			}
		}
	}
	return ans
}
func g(a, b, c int) bool {
	return a != b && b != c && a != c && ((a < b && b > c) || (a > b && b < c))
}