#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>
#include <random>

using namespace std;

vector <long long int> tree;
long long int sum(int i)
{
	long long int ans = 0;
	while (i > 0)
	{
		ans += tree[i];
		i -= (i & -i);
	}
	return ans;
}

void update(int i, long long int diff)
{
	while (i < tree.size())
	{
		tree[i] += diff;
		i += (i & (-i));
	}
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n, a, b, c;
	vector <pair<int, pair<int, int>>> query;
	set <int> S;
	map <int, int> idx;

	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a >> b >> c;
		query.push_back(make_pair(a, make_pair(b, c)));
		if (a == 0)
		{
			S.insert(b);
		}
		else
		{
			S.insert(b);
			S.insert(c);
		}
	}

	int num = 1;
	for (auto it : S)
	{
		idx[it] = num++;
	}

	tree.resize(num);

	long long int res = 0;

	for (int i = 0; i < n; i++)
	{
		if (query[i].first == 0)
		{
			int IDX = idx[query[i].second.first];
			update(IDX, query[i].second.second);
		}
		else
		{
			int L = idx[query[i].second.first];
			int R = idx[query[i].second.second];
			res += (sum(R) - sum(L - 1));
		}
	}

	cout << res << '\n';

	return 0;
}