#include <bits/stdc++.h>
#define ll long long
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define opps cout<<-1<<endl;
const ll con = 1e9;
using namespace std;
string binary(ll x) {
    ll temp = x;
    string s="";
    while (temp) {
        (temp % 2 == 0) ? s += '0' : s += '1';
        temp /= 2;
    }
    reverse(s.begin(), s.end());
    return s;
}
void solve(ll n) {
    int ones = 0 ;
    string x = binary(n);
    for (int i = 0 ; i < x.size() ; i++)
        x[i] == '1' ? ones++ : 0;
    cout<<"The parity of "<<x<<" is "<<ones<<" (mod 2)."<<endl;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll n ;
    while (cin >> n && n != 0) {
        solve( n);
    }
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgWUVTIGNvdXQgPDwgIllFU1xuIjsKI2RlZmluZSBOTyBjb3V0IDw8ICJOT1xuIjsKI2RlZmluZSBvcHBzIGNvdXQ8PC0xPDxlbmRsOwpjb25zdCBsbCBjb24gPSAxZTk7CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnN0cmluZyBiaW5hcnkobGwgeCkgewogICAgbGwgdGVtcCA9IHg7CiAgICBzdHJpbmcgcz0iIjsKICAgIHdoaWxlICh0ZW1wKSB7CiAgICAgICAgKHRlbXAgJSAyID09IDApID8gcyArPSAnMCcgOiBzICs9ICcxJzsKICAgICAgICB0ZW1wIC89IDI7CiAgICB9CiAgICByZXZlcnNlKHMuYmVnaW4oKSwgcy5lbmQoKSk7CiAgICByZXR1cm4gczsKfQp2b2lkIHNvbHZlKGxsIG4pIHsKICAgIGludCBvbmVzID0gMCA7CiAgICBzdHJpbmcgeCA9IGJpbmFyeShuKTsKICAgIGZvciAoaW50IGkgPSAwIDsgaSA8IHguc2l6ZSgpIDsgaSsrKQogICAgICAgIHhbaV0gPT0gJzEnID8gb25lcysrIDogMDsKICAgIGNvdXQ8PCJUaGUgcGFyaXR5IG9mICI8PHg8PCIgaXMgIjw8b25lczw8IiAobW9kIDIpLiI8PGVuZGw7Cn0KaW50IG1haW4oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbygwKTsKICAgIGNpbi50aWUoMCk7CiAgICBsbCBuIDsKICAgIHdoaWxlIChjaW4gPj4gbiAmJiBuICE9IDApIHsKICAgICAgICBzb2x2ZSggbik7CiAgICB9Cn0=