int main()
{
int l, m, n, max;
l = 1000;
m = 65537;
n = 65525;
int bits = 8 * sizeof(int) - 1;
int mod = 1;
for (int i = bits; i >= 0; i--)
{
if ((l & (mod << i)) | (m & (mod << i)))
{
if (l & (mod << i))
{
max = l;
}
else
{
max = m;
}
break;
}
}
for (int i = bits; i >= 0; i--)
{
if ((max & (mod << i)) | (n & (mod << i)))
{
if (!(max & (mod << i)))
{
max = n;
}
break;
}
}
cout << max << endl;
return 0;
}