open System

​

let binary = 

    List.init 31 (fun  n -> (n, pown 2 n))

​

let rec base2 acc n = 

    if n > 0 then 

        let (p, x) = binary |> List.maxBy(fun (p, x) ->  n / x = 1)

        let newAcc = p :: acc

        base2 newAcc (n % x)

    else

        acc |> List.rev |> Set.ofList

​

let convert (base2: Set<int>) =

    let n = base2 |> Set.maxElement

​

    let res = String.init (n + 1) (fun _ -> "0")

    res.ToCharArray ()

    |> Array.mapi( fun i c ->

                 match base2.Contains i with

                    | true -> '1'

                    | false   -> '0'

                    )

    |> Array.rev

    |> Array.map string

    |> Array.reduce (+)

​

let solution = base2 [] >> convert

​

[<EntryPoint>]

let main argv =

    let n = Console.ReadLine() |> int

    List.init n ( fun _ ->

        let num = Console.ReadLine() |> int

        let str = solution num

        printfn "%s" str

        )

    |> ignore

    0