#include using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rep2(i,x,n) for(int i=x; i<(n); i++) #define all(x) x.begin(),x.end() typedef long long ll; typedef unsigned long long ull; ll mod = 1000000007; ll inf = 1e18; int main(){ string s; cin >> s; if(s.size()==1){ if(s=="1"||s=="2"||s=="4"||s=="6") cout << -1 << endl; else cout << 1 << endl; return 0; } int n=(s[s.size()-2]-'0')*10+(s[s.size()-1]-'0'); if(n%4==0) cout << 1 << endl; else if (n%2==0) cout << -1 << endl; else cout << 1 << endl; return 0; }