@@ -0,0 +1,602 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int t = in.nextInt();%0A        for(int a0 = 0; a0 %3C t; a0++)%7B%0A            int n = in.nextInt();%0A            int length=1;%0A            for(int i=0;i%3Cn;i++)%7B%0A                if(i%252==0)%7B%0A                    length*=2;%0A                %7D%0A                else%7B%0A                    length++;%0A                %7D%0A            %7D%0A            System.out.println(length);%0A        %7D%0A    %7D%0A%7D%0A

add UtopianTree.java