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;
void PrintArray(const vector<long long int> &arr) {
  for (int i = 0; i < (int)arr.size(); i++) cout << arr[i] << " ";
  cout << endl;
}
void SieveOfEratosthenes(int n) {
  vector<bool> prime(n + 1, 0);
  prime[0] = 0;
  prime[1] = 0;
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long int factorial(long long int n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
int main() {
  std::ios::sync_with_stdio(false);
  ;
  long long int n;
  cin >> n;
  vector<int> arr(5);
  arr[0] = 8;
  arr[1] = 8;
  arr[2] = 4;
  arr[3] = 2;
  arr[4] = 6;
  cout << arr[n % 4] << endl;
  return 0;
}
