no tags

"Sequoiadendron giganteum (giant sequoia, Sierra redwood, or Wellingtonia) is the sole species in the genus Sequoiadendron, and one of three species of coniferous trees known as redwoods, classified in the family Cupressaceae in the subfamily Sequoioideae, together with Sequoia sempervirens (Coast Redwood) and Metasequoia glyptostroboides (Dawn Redwood). The common use of the name "sequoia" generally refers to Sequoiadendron, which occurs naturally only in the various groves that exist on the western slopes of the Sierra Nevada Mountains of California. " - Wikipedia.

We'll slightly redefine this beautiful tree to fit our needs:

We say our tree is infinite, and rooted in 0. We recursively define the tree as follows:

Let x be the root of a subtree. For all i from [ 0, lg( x - dad(x) )>, we say the children of x are of the form 2i + x, where dad(x) is the index of x's parent. 0 has infinitely many childern. Odd nodes have no children.

You will be given several queries, each consisting of two integers: A and B. You're asked to output the index of the lowest common ancestor of A and B. We define the lowest common ancestor of two nodes to be the node closest to A and B that lies on paths from A to 0 and from B to 0.

### Input

The first line of input contains an integer N, the number of queries. ( 1 <= N <= 100000 )

The next N lines contain a pair of integers, A and B. ( 0 <= A, B <= 1018 )

### Output

You are asked to output N lines, where the i-th line corresponds to the answer to the i-th query.

### Example

```Input:
215 1311 7Output:
120```

 Added by: gustav Date: 2009-12-05 Time limit: 0.108s Source limit: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All except: ASM64 PERL6 Resource: own problem