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 maxn = 1e2 + 123;
const long long inf = 1e18 + 123;
const long double INF = 1e9 + 123;
const int mod = 1e7 + 123;
long long n, a[maxn], sum, cnt, cnt1, cnt2;
int main() {
  cin >> n;
  if (n == 0) {
    cout << 1;
    return 0;
  }
  if (n % 4 == 0) {
    cout << 6;
    return 0;
  }
  if (n % 4 == 1) {
    cout << 8;
    return 0;
  }
  if (n % 4 == 2) {
    cout << 4;
    return 0;
  }
  if (n % 4 == 3) {
    cout << 8;
    return 0;
  }
  return 0;
}
