#include <iostream>
#include <string>
#include <map>

using namespace std;

int main()
{
    int q;
    cin >> q;

    map<string, int> students_marks;

    while (q--)
    {
        int type;
        cin >> type;

        string x;
        cin >> x;

        switch (type)
        {
        case 1:
        {
            int y;
            cin >> y;

            auto pair = students_marks.insert(make_pair(x, y));
            if (!pair.second)
                pair.first->second += y;

            break;
        }

        case 2:
        {
            students_marks.erase(x);

            break;
        }
        default:
        {
            if (students_marks.find(x) != students_marks.end())
                cout << students_marks.at(x) << endl;
            else
                cout << 0 << endl;

            break;
        }
        }
    }
}

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    cin>>t;
    map<string,int>mp;
    while(t--){
        int a;
        cin>>a;
        string s;
        cin>>s;
        if(a==1){
            int marks;
            cin>>marks;
            auto it=mp.find(s);
            if(it!=mp.end()){
                mp[s]+=marks;
            }else{
                mp.insert(make_pair(s,marks));
            }
        }
        if(a==2){
            mp.erase(s);
        }
        if(a==3){
            if(mp.find(s)!=mp.end()){
                cout<<mp[s]<<endl;
            }else{
                cout<<0<<endl;
            }
        }
    }
    return 0;
}