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;
class Solver {
 private:
  long long N, overkill_level = 1378, lasts = 10;

 public:
  Solver() {
    cin >> N;
    cout << pow(overkill_level, N, lasts);
  }
  long long pow(long long x, long long y, long long mod) {
    if (!y) return 1;
    long long ans = pow(x, y / 2, mod);
    if (y & 1)
      return ((((ans % mod) * (ans % mod)) % mod % mod) * (x % mod)) % mod;
    return ((ans % mod) * (ans % mod)) % mod;
  }
};
int main() {
  Solver solver;
  return 0;
}
