description: It is the easy version of the problem. The difference is that in this version, there are no nodes with already chosen colors.
  
  Theofanis is starving, and he wants to eat his favorite food, sheftalia. However, he should first finish his homework. Can you help him with this problem?
  
  You have a perfect binary tree of 2^k - 1 nodes — a binary tree where all vertices i from 1 to 2^{k - 1} - 1 have exactly two children: vertices 2i and 2i + 1. Vertices from 2^{k - 1} to 2^k - 1 don't have any children. You want to color its vertices with the 6 Rubik's cube colors (White, Green, Red, Blue, Orange and Yellow).
  
  Let's call a coloring good when all edges connect nodes with colors that are neighboring sides in the Rubik's cube.
  
  <image>| <image>  
  ---|---  
  A picture of Rubik's cube and its 2D map.
  
  More formally: 
  
    * a white node can not be neighboring with white and yellow nodes; 
    * a yellow node can not be neighboring with white and yellow nodes; 
    * a green node can not be neighboring with green and blue nodes; 
    * a blue node can not be neighboring with green and blue nodes; 
    * a red node can not be neighboring with red and orange nodes; 
    * an orange node can not be neighboring with red and orange nodes; 
  
  
  
  You want to calculate the number of the good colorings of the binary tree. Two colorings are considered different if at least one node is colored with a different color.
  
  The answer may be too large, so output the answer modulo 10^9+7.
  
  Input
  
  The first and only line contains the integers k (1 ≤ k ≤ 60) — the number of levels in the perfect binary tree you need to color.
  
  Output
  
  Print one integer — the number of the different colorings modulo 10^9+7.
  
  Examples
  
  Input
  
  
  3
  
  
  Output
  
  
  24576
  
  
  Input
  
  
  14
  
  
  Output
  
  
  934234
  
  Note
  
  In the picture below, you can see one of the correct colorings of the first example.
  
  <image>
solution: import jdk.dynalink.beans.StaticClass;
  
  import java.util.*;
  import java.io.*;
  
  public class RubiksCubeColoring {
      PrintWriter out;
      StringTokenizer st;
      BufferedReader br;
      final int imax = Integer.MAX_VALUE, imin = Integer.MIN_VALUE;
      final int mod = 1000000007;
  
      void solve() throws Exception {
          int t = 1;
  //        t = ni();
          for (int ii = 0; ii < t; ii++) {
              int n= ni();
              long node= (1l<<n)-1;
  
              out.println(mul(6l, binExp(4, node-1)));
          }
      }
  
      public static void main(String[] args) throws Exception {
          new RubiksCubeColoring().run();
      }
  
      void run() throws Exception {
          if (System.getProperty("ONLINE_JUDGE") == null) {
              File file = new File("./input.txt");
              br = new BufferedReader(new FileReader(file));
              out = new PrintWriter("./output.txt");
          } else {
              out = new PrintWriter(System.out);
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          long ss = System.currentTimeMillis();
          st = new StringTokenizer("");
          while (true) {
              try {
                  solve();
              } catch (Exception e) {
                  e.printStackTrace(out);
              } catch (StackOverflowError e) {
                  e.printStackTrace(out);
              }
  
              String s = br.readLine();
              if (s == null) break;
              else st = new StringTokenizer(s);
          }
          //out.println(System.currentTimeMillis()-ss+"ms");
          out.flush();
      }
  
      void read() throws Exception {
          st = new StringTokenizer(br.readLine());
      }
  
      int ni() throws Exception {
          if (!st.hasMoreTokens()) read();
          return Integer.parseInt(st.nextToken());
      }
  
      char nc() throws Exception {
          if (!st.hasMoreTokens()) read();
          return st.nextToken().charAt(0);
      }
  
      String nw() throws Exception {
          if (!st.hasMoreTokens()) read();
          return st.nextToken();
      }
  
      long nl() throws Exception {
          if (!st.hasMoreTokens()) read();
          return Long.parseLong(st.nextToken());
      }
  
      int[] ni(int n) throws Exception {
          int[] ret = new int[n];
          for (int i = 0; i < n; i++) ret[i] = ni();
          return ret;
      }
  
      long[] nl(int n) throws Exception {
          long[] ret = new long[n];
          for (int i = 0; i < n; i++) ret[i] = nl();
          return ret;
      }
  
      double nd() throws Exception {
          if (!st.hasMoreTokens()) read();
          return Double.parseDouble(st.nextToken());
      }
  
      String ns() throws Exception {
          String s = br.readLine();
          return s.length() == 0 ? br.readLine() : s;
      }
  
      void print(int[] arr) {
          for (int i : arr) out.print(i + " ");
          out.println();
      }
  
      void print(long[] arr) {
          for (long i : arr) out.print(i + " ");
          out.println();
      }
  
      void print(int[][] arr) {
          for (int[] i : arr) {
              for (int j : i) out.print(j + " ");
              out.println();
          }
      }
  
      void print(long[][] arr) {
          for (long[] i : arr) {
              for (long j : i) out.print(j + " ");
              out.println();
          }
      }
  
      long add(long a, long b) {
          if (a + b >= mod) return (a + b) - mod;
          else return a + b >= 0 ? a + b : a + b + mod;
      }
  
      long mul(long a, long b) {
          return (a * b) % mod;
      }
  
      void print(boolean b) {
          if (b) out.println("YES");
          else out.println("NO");
      }
  
      long binExp(long base, long power) {
          long res = 1l;
          while (power != 0) {
              if ((power & 1) == 1) res = mul(res, base);
              base = mul(base, base);
              power >>= 1;
          }
          return res;
      }
  
      long gcd(long a, long b) {
          if (b == 0) return a;
          else return gcd(b, a % b);
      }
  
      // strictly smaller on left
      void stack_l(int[] arr, int[] left) {
          Stack<Integer> stack = new Stack<>();
          for (int i = 0; i < arr.length; i++) {
              while (!stack.isEmpty() && arr[stack.peek()] >= arr[i]) stack.pop();
              if (stack.isEmpty()) left[i] = -1;
              else left[i] = stack.peek();
              stack.push(i);
          }
      }
  
      // strictly smaller on right
      void stack_r(int[] arr, int[] right) {
          Stack<Integer> stack = new Stack<>();
          for (int i = arr.length - 1; i >= 0; i--) {
              while (!stack.isEmpty() && arr[stack.peek()] >= arr[i]) stack.pop();
              if (stack.isEmpty()) right[i] = arr.length;
              else right[i] = stack.peek();
              stack.push(i);
          }
      }
  
      private void sort(int[] arr) {
          List<Integer> list = new ArrayList<>();
          for (int i : arr) list.add(i);
          Collections.sort(list);
          for (int i = 0; i < arr.length; i++) arr[i] = list.get(i);
      }
  }