import Control.Monad
import Control.Applicative
import Data.Maybe
import qualified Data.ByteString.Char8 as B

data Tree = E | T Int Tree Tree
inf = 2^31-1
n_ = 2^17

root = T inf root root

val (T x _ _) = x
val E = inf

update (T _ left right) k x l r
    | r - l == 1 = T x E E
    | k < mid =
        let newleft = update left k x l mid
        in T (min (val newleft) (val right)) newleft right
    | otherwise =
        let newright = update right k x mid r
        in T (min (val left) (val newright)) left newright
    where mid = (l + r) `div` 2

query (T val left right) a b l r
    | b <= l || r <= a = inf
    | a <= l && r <= b = val
    | otherwise = min (query left a b l mid) (query right a b mid r)
    where mid = (l + r) `div` 2

solve [] _ = []
solve ([t,x,y]:qs) tree = case t of
    0 -> solve qs (update tree x y 0 n_)
    1 -> (query tree x (y + 1) 0 n_):(solve qs tree)

main = do
    _ <- getLine
    qs <- map (map (fst . fromJust . B.readInt) . B.words) . B.lines <$> B.getContents
    mapM_ print $ solve qs root
