codeforces #362(div2)-> C. Lorenzo Von Matterhorn (map的使用)



C. Lorenzo Von Matterhorn

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Barney lives in NYC. NYC has infinite number of intersections numbered with positive integers starting from 1. There exists a bidirectional road between intersectionsi and 2i and another road betweeni and 2i + 1 for every positive integeri. You can clearly see that there exists a unique shortest path between any two intersections.

Initially anyone can pass any road for free. But since SlapsGiving is ahead of us, there willq consecutive events happen soon. There are two types of events:

1. Government makes a new rule. A rule can be denoted by integers v, u and w. As the result of this action, the passing fee of all roads on the shortest path fromu to v increases byw dollars.

2. Barney starts moving from some intersection v and goes to intersectionu where there's a girl he wants to cuddle (using his fake name Lorenzo Von Matterhorn). He always uses the shortest path (visiting minimum number of intersections or roads) between two intersections.

Government needs your calculations. For each time Barney goes to cuddle a girl, you need to tell the government how much money he should pay (sum of passing fee of all roads he passes).

Input

The first line of input contains a single integer q (1 ≤ q ≤ 1 000).

The next q lines contain the information about the events in chronological order. Each event is described in form1 v u w if it's an event when government makes a new rule about increasing the passing fee of all roads on the shortest path fromu to v byw dollars, or in form 2 v u if it's an event when Barnie goes to cuddle from the intersectionv to the intersection u.

1 ≤ v, u ≤ 10¹⁸, v ≠ u, 1 ≤ w ≤ 10⁹ states for every description line.

Output

For each event of second type print the sum of passing fee of all roads Barney passes in this event, in one line. Print the answers in chronological order of corresponding events.

Example

Input

7
1 3 4 30
1 4 1 2
1 3 6 8
2 4 3
1 6 1 40
2 3 7
2 2 4

Output

94
0
32

Note

In the example testcase:

Here are the intersections used:

1. Intersections on the path are 3, 1, 2 and 4.
2. Intersections on the path are 4, 2 and 1.
3. Intersections on the path are only 3 and 6.
4. Intersections on the path are 4, 2, 1 and 3. Passing fee of roads on the path are32, 32 and 30 in order. So answer equals to 32 + 32 + 30 = 94.
5. Intersections on the path are 6, 3 and 1.
6. Intersections on the path are 3 and 7. Passing fee of the road between them is 0.
7. Intersections on the path are 2 and 4. Passing fee of the road between them is 32 (increased by30 in the first event and by 2 in the second).                                           题意:就是一棵二叉树（虽然有些点没用上），改变叶子节点到父节点路径的值。

          初始路径值为0，1表示增加路径值，2表示询问，从v到u一共花费多少。

          可能看到10^18，很多人就不敢往下做了，但其实这题很水，想到二叉树，再开map就能做了。                                         
   

   #include<bits/stdc++.h>
   using  namespace std;
   typedef  long  long  ll;
   const int inf=0x3f3f3f3f;
   const int maxn=100100;
   map<ll , ll>mp;
   void  add(ll a, ll w){
       if(mp.find(a)==mp.end())mp[a]=0;//没有访问的先初始化为0
       mp[a]+=w;
   }
   ll val(ll a){
       if(mp.find(a)==mp.end())return 0;
       return mp[a];
   }
   int main()
   {
       std::ios::sync_with_stdio(false);
       std::cin.tie(0);
   //    #ifndef ONLINE_JUDGE
   //        freopen("in.txt", "r", stdin);
   //    #endif
       int  q;
       cin>>q;
       while(q--){
           int f;
           cin>>f;
           if(f==1){
               ll u,v,w;
               cin>>u>>v>>w;
               while(u!=v){
                   if(u>v){ add(u,w); u>>=1;}
                   else{ add(v,w); v>>=1; }
               }
           }
           else{
               ll u,v,ans=0;
               cin>>u>>v;
               while(v!=u){
                   if(u>v){  ans+=val(u); u>>=1;}
                   else{ ans+=val(v); v>>=1;}
               }
               cout<<ans<<endl;
           }
       }
       return 0;
   }