Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Complete Binary Tree

A complete binary tree is a binary tree in which every internal node has two children and all leaves have the same depth. A binary tree in which if last level is not completely filled but all nodes (leaves) are pushed across to the left, is also (nearly) a complete binary tree.

A binary heap data structure is an array that can be viewed as a nearly complete binary tree as shown in the following figure.

Each node of a nearly complete binary tree corresponds to an element of the array that stores the value in the node. An array $A$ that represents a binary heap has the heap size $H$, the number of elements in the heap, and each element of the binary heap is stored into $A[1...H]$ respectively. The root of the tree is $A[1]$, and given the index $i$ of a node, the indices of its parent $parent(i)$, left child $left(i)$, right child $right(i)$ can be computed simply by $\lfloor i / 2 \rfloor$, $2 \times i$ and $2 \times i + 1$ respectively.

Write a program which reads a binary heap represented by a nearly complete binary tree, and prints properties of nodes of the binary heap in the following format:

node $id$: key = $k$, parent key = $pk$, left key = $lk$, right key = $rk$,

$id$, $k$, $pk$, $lk$ and $rk$ represent id (index) of the node, value of the node, value of its parent, value of its left child and value of its right child respectively. Print these properties in this order. If there are no appropriate nodes, print nothing.

Input

In the first line, an integer $H$, the size of the binary heap, is given. In the second line, $H$ integers which correspond to values assigned to nodes of the binary heap are given in order of node id (from $1$ to $H$).

Output

Print the properties of the binary heap in the above format from node $1$ to $H$ in order. Note that, the last character of each line is a single space character.

Constraints

$H \leq 250$

$-2,000,000,000 \leq$ value of a node $\leq 2,000,000,000$

Sample Input 1

5
7 8 1 2 3

Sample Output 1

node 1: key = 7, left key = 8, right key = 1,
node 2: key = 8, parent key = 7, left key = 2, right key = 3,
node 3: key = 1, parent key = 7,
node 4: key = 2, parent key = 8,
node 5: key = 3, parent key = 8,

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in Ruby (judge verdict: Accepted)

class Node
  attr_accessor :id, :key, :parent, :left, :right

  def initialize(id, key)
    @id = id
    @key = key
    @parent = nil
    @left = nil
    @right = nil
  end

  def to_s
    parent_s =
      if @parent != nil
        "parent key = #{@parent.key}, "
      else
        ""
      end

    left_s =
      if @left != nil
        "left key = #{@left.key}, "
      else
        ""
      end

    right_s =
      if @right != nil
        "right key = #{@right.key}, "
      else
        ""
      end

    "node #{@id}: key = #{@key}, #{parent_s}#{left_s}#{right_s}"
  end
end

def left_p(i)
  2 * i
end
def right_p(i)
  2 * i + 1
end
def parent_p(i)
  i / 2
end


n = STDIN.gets.to_i
arr = STDIN.gets.split(' ')

tree = []
arr.each_with_index { |a, i|
  id = i + 1
  left_p = left_p(id)
  right_p = right_p(id)

  node = Node.new(id, a)

  if arr.size >= left_p
    left = Node.new(left_p, arr[left_p - 1])
    left.parent = node
    node.left = left
  end
  if arr.size >= right_p
    right = Node.new(right_p, arr[right_p - 1])
    right.parent = node
    node.right = right
  end
  node.parent = tree[parent_p(i+1) - 1]
  tree[i] = node
}

tree.each {|a|
  puts a
}