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 inf = (int)(1e9);
const long long INF = (long long)(1e18);
const int mod = (int)(1e9 + 7);
const double eps = (double)(1e-9);
const double pi = acos(-1);
void solve();
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(20);
  srand((unsigned)(time(0)));
  solve();
  return 0;
}
const int maxn = (int)(1e5);
const int maxm = (int)(1e5);
int power(int a, int b, int mod) {
  if (b == 1) return a % mod;
  if (b & 1) return a * power(a, b - 1, mod) % mod;
  int tmp = power(a, b / 2, mod);
  return tmp * tmp % mod;
}
void solve() {
  int n;
  cin >> n;
  if (n == 0) {
    cout << 1 << '\n';
    return;
  }
  int x = power(1378, n, 10);
  cout << x << '\n';
}
