import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] queries = new int[n][3]; TreeMap compress = new TreeMap<>(); for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) { queries[i][j] = sc.nextInt(); if (j > 0) { compress.put(queries[i][j], null); } } } int idx = 1; for (int x : compress.keySet()) { compress.put(x, idx); idx++; } long ans = 0; BinaryIndexedTree bit = new BinaryIndexedTree(idx); for (int i = 0; i < n; i++) { if (queries[i][0] == 0) { bit.add(compress.get(queries[i][1]), queries[i][2]); } else { ans += bit.getSum(compress.get(queries[i][1]), compress.get(queries[i][2])); } } System.out.println(ans); } } class BinaryIndexedTree { int size; int[] tree; public BinaryIndexedTree(int size) { this.size = size; tree = new int[size]; } public void add(int idx, int value) { int mask = 1; while (idx < size) { if ((idx & mask) != 0) { tree[idx] += value; idx += mask; } mask <<= 1; } } public int getSum(int from, int to) { return getSum(to) - getSum(from - 1); } public int getSum(int x) { int mask = 1; int ans = 0; while (x > 0) { if ((x & mask) != 0) { ans += tree[x]; x -= mask; } mask <<= 1; } return ans; } }