CF959E Mahmoud and Ehab and the xor-MST

Ehab is interested in the bitwise-xor operation and the special graphs. Mahmoud gave him a problem that combines both. He has a complete graph consisting of $ n $ vertices numbered from $ 0 $ to $ n-1 $ . For all $ 0

The only line contains an integer $ n $ $ (2

The only line contains an integer $ x $ , the weight of the graph's minimum spanning tree.

In the first sample:  The weight of the minimum spanning tree is 1+2+1=4.