Given an unsigned integer N. The task is to swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43(00101011). Here, every even position bit is swapped with adjacent bit on right side(even position bits are highlighted in binary representation of 23), and every odd position bit is swapped with adjacent on left side. Input: The first line of input contains T, denoting the number of testcases. Each testcase contains single line. Output: For each testcase in new line, print the converted number. Constraints: 1 ≤ T ≤ 100 1 ≤ N ≤ 100 Example: Input: 2 23 2 Output: 43 1 Explanation: Testcase 1: BInary representation of the given number; 00010111 after swapping 00101011.

#include <bits/stdc++.h>
using namespace std;

int main() {
	int t; cin>>t; while(t--){
	    int n; cin>>n;
	    int temp[8]={0},c=0,count[8]={0};
	    while(n>0){
	        temp[c]= n&1;
	        c++;
	        n>>=1;
	    }
	   // cout<<"c="<<c<<endl;
	    int k=8-c;
	   // c=0;
	    for(int i=k-1; i<8; i++){
	        count[i]=temp[c--];
	    }
	   //  for(int i=0; i<8; i++) cout<<temp[i];
	    //cout<<'\n';
	    //for(int i=0; i<8; i++) cout<<count[i];
	    //cout<<'\n';
	    for(int i=0; i<8; i=i+2){
	        int t=count[i];
	        count[i]=count[i+1];
	        count[i+1]=t;
	    }
	    long long int ans=0,pos=1;
	    for(int i=7; i>=0; i--){
	        ans+= count[i]*pos;
	        pos<<=1;
	    }
	    cout<<ans<<endl;
	}	    
	return 0;
}