using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var query = NArr(n);
        var set = new HashSet<int>(){ -1 };
        foreach (var que in query)
        {
            if (que[0] == 0) set.Add(que[1]);
            else
            {
                set.Add(que[1]);
                set.Add(que[2] + 1);
            }
        }
        var list = new List<int>(set);
        list.Sort();
        var dic = new Dictionary<int, int>();
        for (var i = 0; i < list.Count; ++i) dic[list[i]] = i;
        var ft = new AtCoder.FenwickTree<long>(list.Count);
        var ans = 0L;
        foreach (var que in query)
        {
            if (que[0] == 0) ft.Add(dic[que[1]], que[2]);
            else ans += ft.Sum(dic[que[2] + 1]) - ft.Sum(dic[que[1]]);
        }
        WriteLine(ans);
    }
}