from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

def ctypes(li, types):
    assert len(li) == len(types)
    return [t(a) for a, t in zip(li, types)]
def qinput(*types, indexed = 1):
    li = input().split()
    t = int(li[0])
    if len(li) == 1: return t, None
    elif len(li) == 2: return t, types[t-indexed][0](li[1])
    else: return t, ctypes(li[1:], types[t-indexed])
for i in range(int(input())):
    t, qi = qinput([int, int], [])
    if t == 1:
        a, b = qi
        print(a+b)
    else:
        print(i+1)