12
 1378
 51202278
 989898989
 4
 7
 9
 6
 8
 12193721
 999999995
 999999999
 11
 999999996
 999999998
 3
 14
 15
 10
 999999994
 1000
 13781378
 5
 999999997
 1000000000
 13
 16
 0

6
 4
 4
 8
 6
 2
 8
 4
 6
 8
 2
 2
 2
 6
 4
 2
 4
 2
 4
 4
 6
 4
 8
 8
 6
 8
 6
 1

import java.util.*;
import java.io.*;

public class Solution {
  public void solve(FastReader in, PrintWriter pw) {
    long n = in.nextLong();
    long ans = (long)Math.pow(8, n);

    pw.println(ans % 10);
  }

  public static void main(String[] args) throws IOException {
    FastReader in = new FastReader();
    PrintWriter pw = new PrintWriter(System.out);
    new Solution().solve(in, pw);
    pw.flush();
    pw.close();
  }

  private void ln(String str) {
    System.out.println(str);
  }
}

class FastReader
{
  BufferedReader br;
  StringTokenizer st;

  public FastReader()
  {
    br=new BufferedReader(new InputStreamReader(System.in));
  }

  public String next()
  {
    if(st==null || !st.hasMoreElements())
    {
      try {
        st=new StringTokenizer(br.readLine());
      } catch(Exception e) {
        throw new RuntimeException(e);
      }
    }
    return st.nextToken();
  }

  public int nextInt()
  {
    return Integer.parseInt(next());
  }

  public long nextLong()
  {
    return Long.parseLong(next());
  }
}
