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: //package codeforces;
  
  import java.io.*;
  import java.util.*;
  
  public class ProblemB {
      private final static FastScanner scanner = new FastScanner();
      private final static long M = 1000000007L;
  
      public static void main(String[] args) throws IOException {
  //        int n = scanner.nextInt();
  //        for (int i = 0; i < n; i++) {
  //            solve();
  //        }
          solve();
      }
  
      public static void solve() {
          long k = scanner.nextLong();
          k--;
          long ans = 6;
          long pow = 16;
          while (k > 0){
              ans *= pow;
              pow *=pow;
              ans %= M;
              pow %= M;
              k--;
          }
          System.out.println(ans % M);
      }
  
  //    public static void solve() {
  //        long n = scanner.nextLong();
  //        long k = scanner.nextLong();
  //        List<Long> sequence = new ArrayList<>();
  //        int pow = 0;
  //        while (k > 0) {
  //            long res = moduloPower(n, pow, M);
  //            pow++;
  //            sequence.add(res % M);
  //            k--;
  //            if (k == 0) {
  //                System.out.println(sequence.get(sequence.size() - 1));
  //                return;
  //            }
  //            int size = sequence.size();
  //            for (int i = 0; i < size - 1; i++) {
  //                long num = sequence.get(i);
  //                sequence.add((res + num) % M);
  //                k--;
  //                if (k == 0) {
  //                    System.out.println(sequence.get(sequence.size() - 1));
  //                    return;
  //                }
  //            }
  //        }
  //    }
  
      public static long getManhattanDistance(long x1, long y1, long x2, long y2) {
          return Math.abs(x1 - x2) + Math.abs(y1 - y2);
      }
  
      public static long lcm(long number1, long number2) {
          if (number1 == 0 || number2 == 0) {
              return 0;
          }
          long absNumber1 = Math.abs(number1);
          long absNumber2 = Math.abs(number2);
          long absHigherNumber = Math.max(absNumber1, absNumber2);
          long absLowerNumber = Math.min(absNumber1, absNumber2);
          long lcm = absHigherNumber;
          while (lcm % absLowerNumber != 0) {
              lcm += absHigherNumber;
          }
          return lcm;
      }
  
      static void swap(int[] arr, int l, int r) {
          int temp = arr[l];
          arr[l] = arr[r];
          arr[r] = temp;
      }
  
      static void swap(long[] arr, int l, int r) {
          long temp = arr[l];
          arr[l] = arr[r];
          arr[r] = temp;
      }
  
      private static int getTickSize(char[][] mat, int i, int j) {
          if (i < 0 || j < 0 || i >= mat.length || j >= mat[0].length || mat[i][j] == '.') return 0;
          mat[i][j] = '.';
          return Math.min(getTickSize(mat, i - 1, j - 1), getTickSize(mat, i - 1, j + 1));
      }
  
      private static Boolean isSquare(long x) {
          long y = (long) Math.sqrt(x);
          return y * y == x;
      }
  
      private static int getMax(int[] arr) {
          int[] copy = Arrays.copyOf(arr, arr.length);
          Arrays.sort(copy);
          return copy[arr.length - 1];
      }
  
      private static double customLog(double logNumber, double base) {
          return Math.log(logNumber) / Math.log(base);
      }
  
  
      static int checkSim(String n1, String n2, int i, int j) {
          if (i >= n1.length() || j >= n2.length()) return 0;
          if (n1.charAt(i) == n2.charAt(j)) return 1 + checkSim(n1, n2, i + 1, j + 1);
          return checkSim(n1, n2, i + 1, j);
      }
  
      static int computeXOR(int n) {
          if (n % 4 == 0)
              return n;
          if (n % 4 == 1)
              return 1;
          if (n % 4 == 2)
              return n + 1;
          return 0;
      }
  
      static boolean isPowerOfTwo(long n) {
          if (n == 0)
              return false;
  
          double v = Math.log(n) / Math.log(2);
          return (long) (Math.ceil(v)) == (long) (Math.floor(v));
      }
  
      static boolean isPrime(int n) {
          if (n <= 1)
              return false;
  
          else if (n == 2)
              return true;
  
          else if (n % 2 == 0)
              return false;
  
          for (int i = 3; i <= Math.sqrt(n); i += 2) {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
  
      static boolean checkSorted(int[] arr) {
          for (int i = 1; i < arr.length; i++) {
              if (arr[i - 1] > arr[i]) return false;
          }
          return true;
      }
  
      static void print(int from, int to) {
          if (from <= to) {
              for (int i = from; i <= to; i++) {
                  System.out.print(i + " ");
              }
          } else {
              System.out.print(from + " ");
              for (int i = 1; i <= to; i++) {
                  System.out.print(i + " ");
              }
          }
      }
  
      static long moduloMultiplication(long a, long b, long mod) {
          long res = 0;
          a %= mod;
          while (b > 0) {
              if ((b & 1) > 0) {
                  res = (res + a) % mod;
              }
              a = (2 * a) % mod;
              b >>= 1;
          }
          return res;
      }
  
      static long moduloPower(long x, long y, long p) {
          long res = 1L;
          x = x % p;
          while (y > 0) {
              if ((y & 1) > 0)
                  res = (res * x) % p;
  
              y = y >> 1;
              x = (x * x) % p;
          }
          return res % p;
      }
  
      static int lowerBound(long a[], long x) { // x is the target value or key
          int l = -1, r = a.length;
          while (l + 1 < r) {
              int m = (l + r) >>> 1;
              if (a[m] >= x) r = m;
              else l = m;
          }
          return r;
      }
  
      static int upperBound(long a[], long x) {// x is the key or target value
          int l = -1, r = a.length;
          while (l + 1 < r) {
              int m = (l + r) >>> 1L;
              if (a[m] <= x) l = m;
              else r = m;
          }
          return l + 1;
      }
  
      static long upperBound(long[] arr, int start, int end, long k) {
          int N = end;
          while (start < end) {
              int mid = start + (end - start) / 2;
              if (k >= arr[mid]) {
                  start = mid + 1;
              } else {
                  end = mid;
              }
          }
          if (start < N && arr[start] <= k) {
              start++;
          }
          return start;
      }
  
      static long lowerBound(long[] arr, int start, int end, long k) {
          int N = end;
          while (start < end) {
              int mid = start + (end - start) / 2;
              if (k <= arr[mid]) {
                  end = mid;
              } else {
                  start = mid + 1;
              }
          }
          if (start < N && arr[start] < k) {
              start++;
          }
          return start;
      }
  
      static int getDistance(int x1, int y1, int x2, int y2) {
          return Math.abs(x1 - x2) + Math.abs(y1 - y2);
      }
  
      static int sumOfNNaturalNumbers(int n) {
          return (n * (n + 1)) / 2;
      }
  
      static long sumOfNNaturalNumbers(long n) {
          return (n * (n + 1)) / 2;
      }
  
      static int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
  
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  }