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;
const long long INF = 1e18 + 4;
const int MAXN = 5 * 1e5 + 1, MODM = 1e9 + 1;
int nn[101];
int check[101][101];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n;
  cin >> n;
  if (n == 0) {
    cout << 1;
    return 0;
  }
  int k = 8;
  int p = k;
  vector<int> mas;
  bool fl = 1;
  while (k != p || fl) {
    fl = 0;
    mas.push_back(k);
    k *= 8;
    k %= 10;
  }
  --n;
  cout << mas[n % mas.size()];
  return 0;
}
