Problem:
Search III

Your task is to write a program of a simple dictionary which implements the following instructions:

insert str: insert a string str in to the dictionary

find str: if the distionary contains str, then print 'yes', otherwise print 'no'

Input

In the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.

Output

Print yes or no for each find instruction in a line.

Constraints

A string consists of 'A', 'C', 'G', or 'T'

1 ≤ length of a string ≤ 12

n ≤ 1000000

Sample Input 1

5
insert A
insert T
insert C
find G
find A

Sample Output 1

no
yes

Sample Input 2

13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T

Sample Output 2

yes
no
no
yes
yes
yes

Notes

Template in C

Solution in Haskell (judge verdict: Accepted)

{-# LANGUAGE OverloadedStrings #-}

import qualified Data.ByteString as BS
import qualified Data.Map.Strict as Map
import Control.Applicative

main :: IO ()
main = do
  n <- readLn
  loop n Map.empty

splitSpace :: BS.ByteString -> [BS.ByteString]
splitSpace = BS.split 32

loop 0 _   = return ()
loop n dic = do
  [c, s] <- splitSpace <$> BS.getLine
  case c of
    "insert" -> loop (n - 1) (Map.insert s n dic)
    "find" -> do
      putStrLn (if Map.member s dic then "yes" else "no")
      loop (n - 1) dic