Utopian Tree.py

'''
Problem Statement: https://www.hackerrank.com/challenges/utopian-tree/problem
@Coded by TSG, 2020
'''

import math
import os
import random
import re
import sys

# Complete the utopianTree function below.
def utopianTree(n):
    boolean = False
    count=0
    for i in range(n+1):
        if(boolean == False):
            count+=1
            boolean = True
        else:
            count*=2
            boolean=False
    return count
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    t = int(input())

    for t_itr in range(t):
        n = int(input())

        result = utopianTree(n)

        fptr.write(str(result) + '\n')

    fptr.close()