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 main() {
  unsigned long int j = 0, n, k = 1, r = 0;
  int a[] = {8, 4, 2, 6, 8, 4, 2, 6, 8, 4, 2, 6,
             8, 4, 2, 6, 8, 4, 2, 6, 8, 4, 2, 6};
  cin >> n;
  if (n >= 8 && n % 4 == 0) {
    cout << 6 << endl;
    return 0;
  }
  if (n == 0) {
    cout << 1 << endl;
    return 0;
  }
  if (n > 0 && n < 8) {
    cout << a[n - 1] << endl;
    return 0;
  }
  if (n > 8) {
    while ((n + j) % 4 != 0) {
      ++j;
    }
  }
  cout << a[7 - j] << endl;
  return 0;
}
