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: Memory Limit Exceeded)

let hash s =
  let len = String.length s in
  let rec loop acc = function
      i when i = len -> acc
    | i ->
      let x = match s.[i] with 'A' -> 1 | 'C' -> 2 | 'G' -> 3 |  _  -> 4 in
      loop (acc*5+x) (i+1)
  in loop 0 0

let () =
  let n = read_int () in
  let dic = Array.make (5. ** 12. |> int_of_float) false in
  let rec loop = function
      0 -> ()
    | i ->
      begin match Scanf.scanf "%s %s\n" (fun a b -> a,b) with
          "insert",word -> dic.(hash word) <- true
        | _,word ->
          print_endline
            (if dic.(hash word) then "yes" else "no")
      end;
      loop (i-1)
  in
  loop n