Given a height h, count and return the maximum number of balanced binary trees possible with height h. A balanced binary tree is one in which for every node, the difference between heights of left and right subtree is not more than 1.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer height h.
Count the maximum number of balanced binary trees possible with height h.