// template

// template.IO
let read = fun () -> stdin.ReadLine()
let readf f = stdin.ReadLine() |> f
let readarr = fun () -> stdin.ReadLine().Split(' ')

let readarrf f =
    stdin.ReadLine().Split(' ') |> Array.map f

// template.algorithms
let rec binarySearch f (ng, ok) =
    let mid = (ok + ng) / 2

    if abs (ok - ng) > 1 then
        if f mid then
            binarySearch f (ng, mid)
        else
            binarySearch f (mid, ok)
    else
        ok

let lowerBound (arr: 'a[]) x =
    binarySearch (fun i -> arr.[i] >= x) (-1, arr.Length)

let upperBound (arr: 'a[]) x =
    binarySearch (fun i -> arr.[i] > x) (-1, arr.Length)



// solution

let t = readf int

seq { 1..t }
|> Seq.map (fun _ ->
    let n = readf int64
    n * (n + 1L))
|> Array.ofSeq
|> Array.map (fun i -> printfn "%d" i)