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>
const int nax = 1000 * 1007;
const long long mod = 1e9 + 7;
const int mx = 1e7 + 9;
bool prime[1000000 + 7];
using namespace std;
void fun1() {
  long long a[4] = {6, 8, 4, 2}, n;
  cin >> n;
  if (n == 0)
    cout << 1 << endl;
  else {
    cout << a[n % 4] << endl;
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  fun1();
}
