#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { string n; cin >> n; if(n == "1" || n == "2" || n == "4" || n == "6"){ cout << -1 << endl; return 0; } int m = n.size(); if(m == 1 || n[m-1]=='1'||n[m-1]=='3'||n[m-1]=='5'||n[m-1]=='7'||n[m-1]=='9'){ cout << 1 << endl; return 0; } int x = (n[m-2]-'0')*10 + (n[m-1]-'0'); if(x % 4 == 0){ cout << 1 << endl; }else{ cout << -1 << endl; } return 0; }