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 OCaml (judge verdict: Accepted)

let to_num s =
  let sym_to_num = function
    | 'A' -> 1
    | 'C' -> 2
    | 'G' -> 3
    | 'T' -> 4
    | _ -> exit 1
  in
  let n = String.length s in
  let rec doit i acc =
    if i = n then acc
    else doit (i + 1) (4*acc + sym_to_num s.[i])
  in
  doit 0 0

let () =
  let tbl = Array.make (22369620 + 1) false in
  let n = read_int () in
  let rec doit i =
    if i < n then begin
      match Scanf.scanf "%s %s\n" (fun x y -> x, y) with
      | ("insert", x) -> (tbl.(to_num x) <- true; doit (i + 1))
      | ("find", x) -> (print_endline (if tbl.(to_num x) then "yes" else "no"); doit (i + 1))
      | _ -> exit 1
    end
  in
  doit 0