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

#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T getNext() {
  T s = 1, x = 0, c = getc(stdin);
  while (c <= 32) c = getc(stdin);
  if (c == '-') s = -1, c = getc(stdin);
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getc(stdin);
  return x * s;
}
const double eps = 1e-9;
bool Equals(double x, double y) { return abs(x - y) < eps; }
bool Less(double x, double y) { return (x) < y - eps; }
bool LessOrEqual(double x, double y) { return (x) < y + eps; }
const int MaxN = (int)(2e5) + 256;
int main() {
  int n;
  scanf("%d", &n);
  int a = 1378;
  int res = 1;
  while (n) {
    if (n & 1) {
      res = (res * 1ll * a) % 10;
    }
    a = (a * 1ll * a) % 10;
    n >>= 1;
  }
  cout << res % 10;
  return 0;
}
