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() {
  long long int tmp = 1378;
  int n, t;
  vector<int> p;
  p.push_back(8);
  scanf("%d", &n);
  while (true) {
    tmp *= 1378;
    if (p.at(0) == tmp % 10) {
      break;
    }
    p.push_back(tmp % 10);
  }
  t = n % p.size() - 1;
  if (t < 0) {
    t = p.size() - 1;
  }
  printf("%d", p.at(t));
}
