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 isPrime(long long x) {
  long long i, flag = 1;
  if (x == 0 || x == 1) {
    flag = 0;
  }
  for (i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long fact(long long n) {
  long long ans = 1;
  for (long long i = 2; i <= n; i++) {
    ans *= i;
  }
  return ans;
}
const long long INF = 1e18;
const long long N = 2 * 1e5;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  {
    long long n;
    cin >> n;
    if (n == 1) {
      cout << 8 << "\n";
    } else {
      if (n % 5 == 2) {
        cout << 4 << "\n";
      } else if (n % 5 == 3) {
        cout << 2 << "\n";
      } else if (n % 5 == 4) {
        cout << 6 << "\n";
      } else if (n % 5 == 0) {
        cout << 8 << "\n";
      }
    }
  }
  return 0;
}
