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;
constexpr int inf = 1e9 + 7;
constexpr long long md = 1e6;
void solve(int testi) {
  int n;
  cin >> n;
  if (n == 0) {
    cout << 1 << '\n';
    ;
  }
  vector<int> digits = {6, 8, 4, 2};
  cout << digits[n % digits.size()] << '\n';
  ;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long testn = 1;
  for (long long testi = 1; testi <= testn; testi++) {
    solve(testi);
  }
}
