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;
long long d = 1, x = 1, y = 1;
long long power(long long x, long long y);
long long eg(long long a, long long b);
long long maxr(vector<long long> v, long long k);
bool isprime(long long n);
vector<long long> aaja(long long n);
vector<long long> soe(long long n);
void eeg(long long a, long long b);
vector<long long> aaja(long long n) {
  long long i, j;
  vector<long long> v;
  for (i = 0; i < n; i++) {
    cin >> j;
    v.push_back(j);
  }
  return v;
}
long long mjekrtehai() {
  long long i, j, n, m;
  cin >> n;
  if (n == 0) {
    cout << 1 << "\n";
    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;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) mjekrtehai();
  return 0;
}
