// (⁠◕⁠ᴗ⁠◕⁠✿⁠) // #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #define rep(i, n) for (ll i = 0; i < (n); i++) #define srep(i, s, n) for (ll i = s; i < (n); i++) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; template using vc = vector; template using vv = vc>; template using vvv = vv>; using vi = vc;using vvi = vv; using vvvi = vv; using ll = long long;using vl = vc;using vvl = vv; using vvvl = vv; using ld = long double; using vld = vc; using vvld = vc; using vvvld = vc; using uint = unsigned int; using ull = unsigned long long; const ld pi = acos(-1.0); const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; const ll mod = 1000000007; // const ll mod = 998244353; inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); } #define debug(var) do{std::cout << #var << " : \n";view(var);}while(0) template void view(T e){cout << e << endl;} template void view(const vc& v){for(const auto& e : v){ cout << e << " "; } cout << endl;} template void view(const vv& vv){ for(const auto& v : vv){ view(v); } } ll pow_mod(ll a, ll d, ll m){ ll ret = 1; while (d > 0){ if (d & 1){ ret *= a; ret %= m; } a = a * a % m; d >>= 1; } return ret; } vc eratosthenes(int t){ vc is_prime(t + 1, true); is_prime[0] = false; is_prime[1] = false; for (int i = 0; i <= t; i++){ if (is_prime[i]){ for (int q = i * 2; q <= t; q += i){ is_prime[q] = false; } } } return is_prime; } int main(){ // auto is_prime = eratosthenes(1e5); // srep(b, 100, 1e5 + 1) if (is_prime[b]){ // for (ll a = b - 1; a <= 1e5; a += b - 1) if (pow_mod(a, b, mod) % b == 0){ // cout << a << " " << b << endl; // } // } cout << 49338 << " " << 5483 << endl; int K; cin >> K; if (K % 5483) cout << 1 << endl; else cout << 0 << endl; int ret;cin >> ret; }