ProjectGammaX

A Fibonacci tree is defined in the following way: on level 0 there is the root, which has a single child on level 1. Then each node from level i, with i > 2, has as many children as its parent together with its grandparent (its parent's parent).

Then we do a breadth first search traversal of the tree and we label all the nodes with numbers starting from 1 and increasing with 1 unit, beginning with the root.

Each node is initially inactive and it will be activated once an operation of type 1 is performed on it. More generally, the operations we can choose to perform on the tree are as follows:

• 1 X Y Z - increase with Z the value assigned to the least common ancestor of the nodes labeled by X and Y. Note that Z can be negative, which means you are actually decreasing the value. Also, if the value from that node is empty, then you should consider it as being 0 before adding.
• 2 X Y - compute the maximum value assigned to a node from the closed interval [X, Y]. However, be aware that you should not consider the yet inactive nodes (so here, if a node is inactive, don't suppose its value is 0, simply ignore that node). Note that it is possible for all the nodes to be inactive. In that case, print "Comisia" instead.

Input

The first line of input contains a single integer M - the number of operations.

The next M line of input contains one of the described operations, having the format above.

Output

For each operation of type 2, print the requested value.

Restrictions

• 1 ≤ M ≤ 10⁵
• 1 ≤ X ≤ Y ≤ 10¹⁸
• -10¹² ≤ Z ≤ 10¹²

Sample