# Hackerrank - Utopian Tree Solution

The Utopian Tree goes through *2* cycles of growth every year. Each spring, it *doubles* in height. Each summer, its height increases by *1* meter.

Laura plants a Utopian Tree sapling with a height of *1* meter at the onset of spring. How tall will her tree be after growth cycles?

For example, if the number of growth cycles is , the calculations are as follows:

```
Period Height
0 1
1 2
2 3
3 6
4 7
5 14
```

**Function Description**

Complete the *utopianTree* function in the editor below. It should return the integer height of the tree after the input number of growth cycles.

utopianTree has the following parameter(s):

*n*: an integer, the number of growth cycles to simulate

**Input Format**

The first line contains an integer, , the number of test cases.

subsequent lines each contain an integer, , denoting the number of cycles for that test case.

**Constraints**

**Output Format**

For each test case, print the height of the Utopian Tree after cycles. Each height must be printed on a new line.

**Sample Input**

```
3
0
1
4
```

**Sample Output**

```
1
2
7
```

**Explanation**

There are *3* test cases.

In the first case (), the initial height () of the tree remains unchanged.

In the second case (), the tree doubles in height and is meters tall after the spring cycle.

In the third case (), the tree doubles its height in spring (, ), then grows a meter in summer (, ), then doubles after the next spring (, ), and grows another meter after summer (, ). Thus, at the end of 4 cycles, its height is meters.

### Solution in Python

```
def utopianTree(n):
x=0
for i in range(n+1):
if i%2:
x*=2
else:
x+=1
return x
for i in range(int(input())):
print(utopianTree(int(input())))
```

*Better solution by asbear*

```
def utopianTree(n):
return ~(~1<<(n>>1)) << n%2
for i in range(int(input())):
print(utopianTree(int(input())))
```