@@ -0,0 +1,718 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0A/**%0A*   Solution to https://www.hackerrank.com/challenges/utopian-tree/%0A*/%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A%0A        int tests = in.nextInt();%0A%0A        for (int i = 0; i %3C tests; i++) %7B%0A            int cycles = in.nextInt();%0A            long total = 1L;%0A%0A            for (int j = 0; j %3C cycles; j++) %7B%0A                if (j %25 2 == 0) %7B%0A                    total *= 2;%0A                %7D%0A                else %7B%0A                    total += 1;%0A                %7D%0A            %7D%0A%0A            System.out.println(total);%0A        %7D%0A    %7D%0A%7D%0A

Create utopian-tree.java