#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  string S;
  cin>>S;
  int check;
  if(S.size()>=2) check = (S[S.size()-2]-'0')*10+(S[S.size()-1]-'0');
  else check = S[S.size()-1]-'0';
  if(S=="1" || S=="4") {
    cout<<-1<<endl;
    return 0;
  }
  if(check%4==0 || check%2==1) cout<<1<<endl;
  else cout<<-1<<endl;
}