#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    let n: usize = kin.input();
    let qs: Vec<(u32, u32, u32)> = kin.seq(n);
    let mut cood = Vec::new();
    for &(t, a, b) in &qs {
        if t == 0 {
            cood.push(a);
        } else {
            cood.push(a);
            cood.push(b + 1);
        }
    }
    cood.sort();
    cood.dedup();
    eout!("{:?}",cood);
    let mut ft = FenwickTree::new(cood.len(), || 0, |x, y| x + y);
    let mut ans = 0;
    for &(t, a, b) in &qs {
        if t == 0 {
            let x = lower_bound(&cood, &a);
            ft.add(x, b as u64);
        } else {
            let l = lower_bound(&cood, &a);
            let r = lower_bound(&cood, &(b + 1));
            ans += ft.sum(r) - ft.sum(l);
        }
    }
    outln!(out, "{}", ans);
}
pub struct FenwickTree<T, F, Z> {
    a: Vec<T>,
    f: F,
    z: Z,
}
impl<T, F: Fn(&T, &T) -> T, Z: Fn() -> T> FenwickTree<T, F, Z> {
    pub fn new(n: usize, z: Z, f: F) -> Self {
        Self {
            a: (0..=n).map(|_| z()).collect(),
            f,
            z,
        }
    }
    pub fn add(&mut self, mut i: usize, x: T) {
        i += 1;
        while i < self.a.len() {
            self.a[i] = (self.f)(&self.a[i], &x);
            i += i & (!i + 1);
        }
    }
    // [0, i)
    pub fn sum(&self, mut i: usize) -> T {
        let mut s = (self.z)();
        while i > 0 {
            s = (self.f)(&self.a[i], &s);
            i -= i & (!i + 1);
        }
        s
    }
    pub fn reset(&mut self) {
        for a in &mut self.a {
            *a = (self.z)();
        }
    }
}
pub fn lower_bound<T: Ord>(a: &[T], x: &T) -> usize {
    bisect(a, |v| v >= x)
}
pub fn upper_bound<T: Ord>(a: &[T], x: &T) -> usize {
    bisect(a, |v| v > x)
}
fn bisect<T: Ord, F: Fn(&T) -> bool>(a: &[T], cond: F) -> usize {
    let mut l = -1;
    let mut r = a.len() as isize;
    while r - l > 1 {
        let m = (l + r) / 2;
        if cond(&a[m as usize]) {
            r = m;
        } else {
            l = m;
        }
    }
    r as usize
}

// -----------------------------------------------------------------------------
fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            run(
                KInput::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

#[macro_export]
macro_rules! out {
    ($($arg:tt)*) => { write!($($arg)*).unwrap(); }
}
#[macro_export]
macro_rules! outln {
    ($dst:expr $(, $($arg:tt)*)?) => {{
        writeln!($dst $(, $($arg)*)?).unwrap();
        if cfg!(debug_assertions) { $dst.flush().unwrap(); }
    }}
}
#[macro_export]
macro_rules! eout {
    ($($arg:tt)*) => { if cfg!(debug_assertions) { eprintln!($($arg)*); } }
}
#[macro_export]
macro_rules! kdbg {
    ($($v:expr),*) => { if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) } }
}

pub mod kyoproio {
    use std::{
        io::prelude::*,
        iter::FromIterator,
        marker::PhantomData,
        mem::{self, MaybeUninit},
        str,
    };

    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            str::from_utf8(self.bytes()).unwrap()
        }
        fn input<T: InputItem>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputItem>(&mut self) -> Iter<T, Self> {
            Iter(self, PhantomData)
        }
        fn seq<T: InputItem, B: FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: Vec<u8>,
        pos: usize,
        len: usize,
    }
    impl<R: Read> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: vec![0; 1 << 16],
                pos: 0,
                len: 0,
            }
        }
        fn read(&mut self) -> usize {
            if self.pos > 0 {
                self.buf.copy_within(self.pos..self.len, 0);
                self.len -= self.pos;
                self.pos = 0;
            } else if self.len >= self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            let n = self.src.read(&mut self.buf[self.len..]).unwrap();
            self.len += n;
            n
        }
    }
    impl<R: Read> Input for KInput<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(d) = self.buf[self.pos..self.len]
                    .iter()
                    .position(u8::is_ascii_whitespace)
                {
                    let p = self.pos;
                    self.pos += d + 1;
                    if d > 0 {
                        return &self.buf[p..p + d];
                    }
                }
                if self.read() == 0 {
                    return &self.buf[mem::replace(&mut self.pos, self.len)..self.len];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, PhantomData<*const T>);
    impl<'a, T: InputItem, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    pub trait InputItem: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputItem for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.bytes().to_owned()
        }
    }
    macro_rules! from_str {
        ($($T:ty)*) => {
            $(impl InputItem for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().unwrap()
                }
            })*
        }
    }
    from_str!(String char bool f32 f64);
    macro_rules! parse_int {
        ($($I:ty: $U:ty)*) => {
            $(impl InputItem for $I {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let f = |s: &[u8]| s.iter().fold(0, |x, b| 10 * x + (b & 0xf) as $I);
                    let s = src.bytes();
                    if let Some((&b'-', t)) = s.split_first() { -f(t) } else { f(s) }
                }
            }
            impl InputItem for $U {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().iter().fold(0, |x, b| 10 * x + (b & 0xf) as $U)
                }
            })*
        }
    }
    parse_int!(isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128);
    macro_rules! tuple {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputItem, $($T: InputItem),*> InputItem for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple!($($T)*);
        };
        () => {}
    }
    tuple!(A B C D E F G);
    macro_rules! array {
        ($($N:literal)*) => {
            $(impl<T: InputItem> InputItem for [T; $N] {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let mut arr = MaybeUninit::uninit();
                    let ptr = arr.as_mut_ptr() as *mut T;
                    unsafe {
                        for i in 0..$N {
                            ptr.add(i).write(src.input());
                        }
                        arr.assume_init()
                    }
                }
            })*
        }
    }
    array!(1 2 3 4 5 6 7 8);
}