#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    string s;
    cin >> s;
    if(s.size() < 2){
        if(s == "1" || s == "2" || s == "4" ||  s == "6") puts("-1");
        else puts("1");
    }else {
        int x = s.back() - '0';
        s.pop_back();
        x += (s.back()-'0')*10;
        if(x%4 == 2) puts("-1");
        else puts("1");
    }

    return 0;
}