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;
int bigmod(int base, int power, int mod);
int main() {
  int p;
  while (cin >> p) cout << bigmod(1378, p, 10) << endl;
  return 0;
}
int bigmod(int base, int power, int mod) {
  int p1, p2;
  if (power == 0)
    return 1;
  else if (power & 1) {
    p1 = base % mod;
    p2 = (bigmod(base, power - 1, mod)) % mod;
    return (p1 * p2) % mod;
  } else if (power % 2 == 0) {
    p1 = (bigmod(base, power / 2, mod)) % mod;
    return (p1 * p1) % mod;
  }
}
