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;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using pcc = pair<char, char>;
using pdd = pair<double, double>;
using pci = pair<char, int>;
using si = set<int>;
using s = string;
using seti = set<int>;
using useti = unordered_set<int>;
using mseti = multiset<int>;
using umseti = unordered_multiset<int>;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vd = vector<double>;
using vll = vector<ll>;
using vpii = vector<pii>;
using msi = map<string, int>;
using umsi = unordered_map<string, int>;
void solve() {
  ll n;
  cin >> n;
  if (n == 0) {
    cout << 1 << "\n";
  }
  int rem = n % 4;
  switch (rem) {
    case 0:
      cout << 6 << "\n";
      break;
    case 1:
      cout << 8 << "\n";
      break;
    case 2:
      cout << 4 << "\n";
      break;
    case 3:
      cout << 2 << "\n";
      break;
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cout.tie(nullptr);
  solve();
  return 0;
}
