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;
long long mod = 1000000000 + 7;
long long pow(long long a, long long b, long long m) {
  stack<int> k;
  int j = 128;
  int l = 1;
  int an = 1;
  while (b) {
    if (b >= j) {
      k.push(j);
      b -= j;
    }
    j /= 2;
  }
  while (!k.empty()) {
    if (k.top() == l) {
      an = (an * a) % mod;
      k.pop();
    }
    a = (a * a) % mod;
    l *= 2;
  }
  return an;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n;
  cin >> n;
  if (n % 5 == 1 || n % 5 == 0) {
    cout << 8 << endl;
  } else if (n % 5 == 2) {
    cout << 4 << endl;
  } else if (n % 5 == 3) {
    cout << 2 << endl;
  } else if (n % 5 == 4) {
    cout << 6 << endl;
  }
  return 0;
}
