#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define SZ(x) (int)(x.size()) #define REP(i, n) for(int i=0;i=0;--i) #define RFOR(i, a, b) for(int i=b-1;i>=a;--i) #define all(x) begin(x),end(x) #define dump(x) cerr<<#x<<" = "<<(x)<; using vvi = vector; using vll = vector; using vvll = vector; using P = pair; const double eps = 1e-8; const ll MOD = 1000000007; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } template ostream &operator<<(ostream &os, const pair p) { os << p.first << ":" << p.second; return os; } template ostream &operator<<(ostream &os, const vector &v) { os << "["; REP(i, SZ(v)) { if (i) os << ", "; os << v[i]; } return os << "]"; } template ostream &operator<<(ostream &os, const map &mp) { os << "["; for (auto it = mp.begin(); it != mp.end(); ++it) { if (it != mp.begin()) { os << ", "; } os << *it; } return os << "]"; } // edit void solve() { string N; cin >> N; if (N.size() < 2) { ll val; val = stol(N); if ((val % 2 == 1 && val >= 3) || (val % 4 == 0 && val >= 8)) { cout << 1 << endl; } else { cout << -1 << endl; } } else { ll val; string T; T += *(N.end() - 2); T += *(N.end() - 1); val = stol(T); if ((val % 2 == 1) || (val % 4 == 0)) { cout << 1 << endl; } else { cout << -1 << endl; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); // std::ifstream in("input.txt"); // std::cin.rdbuf(in.rdbuf()); solve(); return 0; }