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>
#pragma GCC optimize("O3")
using namespace std;
const int inf = 1e7;
const int MAXM = 1e5 + 5;
const int MAXN = 1e6 + 4;
int a[MAXM];
int main() {
  long long n;
  scanf("%lld", &n);
  if (n == 0) {
    cout << 1 << endl;
    return 0;
  }
  if (n % 4 == 0) {
    cout << "6\n";
  } else if (n % 4 == 1) {
    cout << "8\n";
  } else if (n % 4 == 2) {
    cout << "4\n";
  } else {
    cout << "2\n";
  }
  return 0;
}
