import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); boolean[] isAdds = new boolean[n]; int[] lefts = new int[n]; int[] rights = new int[n]; TreeMap compress = new TreeMap<>(); for (int i = 0; i < n; i++) { isAdds[i] = (sc.nextInt() == 0); lefts[i] = sc.nextInt(); rights[i] = sc.nextInt(); if (isAdds[i]) { compress.put(lefts[i], null); } } int idx = 1; for (int x : compress.keySet()) { compress.put(x, idx++); } BinaryIndexedTree bit = new BinaryIndexedTree(idx); int ans = 0; for (int i = 0; i < n; i++) { if (isAdds[i]) { bit.add(compress.get(lefts[i]), rights[i]); } else { ans += bit.getSum(compress.ceilingEntry(lefts[i]).getValue(), compress.floorEntry(rights[i]).getValue()); } } 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; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }