#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int MAXN = 1e3 + 10 ; //dummy
class BinaryHeapLeaf{
public :
vector < int > maxDiff( int N) {
int mn = 0 ;
int mx = 0 ;
int curr2 = 1 ;
int l = 0 ;
int t = 2 ;
while ( curr2 <= N) {
curr2 + = t;
t * = 2 ;
l++ ;
}
l-- ;
vector< int > ans;
mx = N - l;
mn = ( N + 1 ) / 2 ;
if ( N == 2 ) mx = 1 ;
ans.push_back ( mn) ;
ans.push_back ( mx) ;
return ans;
}
} ;
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKI2RlZmluZSBsbCBsb25nIGxvbmcgaW50Cgpjb25zdCBpbnQgTUFYTiA9IDFlMyArIDEwOyAvL2R1bW15CgpjbGFzcyBCaW5hcnlIZWFwTGVhZnsKCXB1YmxpYzoKCXZlY3RvciA8aW50PiBtYXhEaWZmKGludCBOKXsKCQlpbnQgbW4gPSAwOwoJCWludCBteCA9IDA7CgkJaW50IGN1cnIyID0gMTsKCQlpbnQgbCA9IDA7CgkJaW50IHQgPSAyOwoJCXdoaWxlKCBjdXJyMiA8PSBOKXsKCQkJY3VycjIgKz0gdDsKCQkJdCAqPSAyOwoJCQlsKys7CgkJfQogICAgICAgIGwtLTsKCQl2ZWN0b3I8aW50PiBhbnM7CgkJbXggPSBOIC0gbDsKCQltbiA9IChOICsgMSkvMjsKICAgICAgICBpZiggTiA9PSAyKSBteCA9IDE7CgkJYW5zLnB1c2hfYmFjayhtbik7CgkJYW5zLnB1c2hfYmFjayhteCk7CgkJcmV0dXJuIGFuczsKCX0KfTs=