@@ -0,0 +1,735 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class UtopianTree %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            if (n==0) System.out.println(1);%0A            else %7B%0A                int sum=0;%0A                int condition=n%252==0?(n/2):n/2+1;%0A                for (int i=1;i%3C=condition;i++) %7B%0A                    sum+=(int)Math.pow(2,i);%0A                %7D%0A                if (n%252!=0) System.out.println(sum);%0A                else System.out.println(sum+1);%0A                sum=0;%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

Create UtopianTree.java