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>
int big_mod(long long base, long long power, long long mod) {
  long long int r1, r2;
  if (power == 0)
    return 1;
  else if (power % 2 == 0) {
    r1 = (big_mod(base, power / 2, mod) % mod);
    return (r1 * r1) % mod;
  } else if (power % 2 == 1) {
    r1 = base % mod;
    r2 = (big_mod(base, power - 1, mod) % mod);
    return (r1 * r2) % mod;
  }
}
int main() {
  long long int power, base = 1378, mod = 10;
  scanf("%ld", &power);
  printf("%ld\n", big_mod(base, power, mod));
  return 0;
}
