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>
int main() {
  long long int n, i, t, k = 0, x, g, d = 0, j, m, w, sum = 0, count = 1;
  scanf("%lld", &n);
  long long int a[n], b[n];
  if (n == 0) {
    printf("1");
  } else if (n == 1) {
    printf("8");
  } else if (n % 2 == 0) {
    g = (n / 2);
    if (g % 2 == 0) {
      printf("6");
    } else {
      printf("4");
    }
  } else {
    m = (n / 2);
    if (m % 2 == 0) {
      printf("8");
    } else {
      printf("2");
    }
  }
  return 0;
}
