#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
long long moding(string s, long long modding) {
	long long hoge = 0;
	long long now = 1;
	REP(i, s.length()) {
		hoge += now * (s[s.length() - i - 1] - '0');
		hoge %= modding;
		now *= 10;
		now %= modding;
	}
	return hoge;
}
int main(){
	string n, k;
	cin >> n;
	k = "1";
	long long now = 1;
	long long hoge = moding(n, 6);
	if (hoge == 0) {
		cout << "4" << endl;
	}
	else if (hoge == 1) {
		cout << "2" << endl;
	}
	else if (hoge == 2) {
		if ((k[k.length() - 1] - '0') % 2 == 1) {
			cout << "8" << endl;
		}
		else {
			cout << "7" << endl;
		}
	}
	else if (hoge == 3) {
		cout << "5" << endl;
	}
	else if (hoge == 4) {
		cout << "7" << endl;
	}
	else if (hoge == 5) {
		if ((k[k.length() - 1] - '0') % 2 == 1) {
			cout << "1" << endl;
		}
		else {
			cout << "2" << endl;
		}
	}
	return 0;
}