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>
long long i, j;
const int mod = 1000000007;
using namespace std;
void solve() {
  long long n, p = 0, ct = 0, sum = 0, k;
  string s;
  cin >> n;
  if (n == 0)
    cout << "1";
  else if (n % 4 == 0)
    cout << "8";
  else if (n % 4 == 1)
    cout << 4;
  else if (n % 4 == 2)
    cout << 2;
  else
    cout << 6;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  {
    solve();
    cout << "\n";
  }
  return 0;
}
