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 Modulo(int a, char b[]) {
  int mod = 0;
  for (int i = 0; i < strlen(b); i++) mod = (mod * 10 + b[i] - '0') % a;
  return mod;
}
int LastDigit(char a[], char b[]) {
  int len_a = strlen(a), len_b = strlen(b);
  if (len_a == 1 && len_b == 1 && b[0] == '0' && a[0] == '0') return 1;
  if (len_b == 1 && b[0] == '0') return 1;
  if (len_a == 1 && a[0] == '0') return 0;
  int exp = (Modulo(4, b) == 0) ? 4 : Modulo(4, b);
  int res = pow(a[len_a - 1] - '0', exp);
  return res % 10;
}
int main() {
  char a[] = "1378", b[100];
  cin >> b;
  cout << LastDigit(a, b);
  return 0;
}
