View Code of Problem 3700

#include<cstdio>
#include<cstring>
#include<stdio.h>
#include<cmath>
#include<iostream>
#include<algorithm>
#define N 100
using namespace std;
int main()
{
	int t;
	while(scanf("%d",&t)!=EOF&&t!=0){
	int a[10000];
	int n=0;
	while(t!=0){
		int x=t%2;
		a[n++]=x;
		t=t/2;
    }
    int b[10000];
    int k=0;
    for(int i=n-1;i>=0;i--){
    	b[k++]=a[i];
	}
	int q=0;
	for(int i=k-1;i>=0;i--){
		q++;
		if(b[i]==1){
			break;
		}
	}
	cout<<pow(2,q-1)<<endl;
}
	return 0;
}