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;
const int N = 1e5 + 5;
int quickpow(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res *= a;
    res %= 10;
    a *= a;
    a %= 10;
    b >>= 1;
  }
  return res;
}
int main() {
  int n;
  scanf("%d", &n);
  printf("%d\n", quickpow(1378, n));
  return 0;
}
