UVA_11993_Splitting_Numbers

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

int main() {
    int n;
    while(scanf("%d",&n)){
        if(n==0) break;
        vector<int> v;
        for(int i=0;i<31;i++){
          if((1 << i) & n ) v.push_back(i);
        }
        int a=0;int b=0;
        for(int i=0;i<v.size();i++){
            if(i%2) b|=(1<<v[i]);
            else a|=(1<<v[i]);
        }
        printf("%d %d\n",a,b);
    }
    return 0;
}