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(long long int a, long long int p) {
  int x, y, power;
  if (p == 0) return 1;
  if (p % 2 == 0) {
    power = p / 2;
    x = (pow(a, p / 2));
    x %= 10;
    y = x;
    return x * y;
  } else {
    power = p - 1;
    int k = pow(a, p - 1);
    k %= 10;
    return (a % 10) * k;
  }
}
int main() {
  long long int power, L_digit;
  cin >> power;
  L_digit = (BigMod(8, power) % 10);
  cout << L_digit << endl;
  return 0;
}
