混沌的云

import java.util.*;
/**
 *
 * @author yanglingfeng
 */
 class TernaryTree {
 
    private class Node {
 
        char m_char;
        Node left, right, middle;
        boolean end;
        int co;
 
        public Node(char ch, boolean e) {
            m_char = ch;
            end = e;
            co=0;
        }
 
        public Node(char ch, boolean e, Node leftc, Node rightc, Node middlec) {
            m_char = ch;
            end = e;
            left = leftc;
            right = rightc;
            middle = middlec;
        }
    }
    private Node root;
    private int count;
 
    /**
     * 初始化三叉树
     */
    public TernaryTree() {
        clear();
    }
 
    /**
     * 清除三叉树
     */
    public final void clear() {
        root = null;
        count = 0;
    }
 
    /**
     * 插入一个字符串
     * @param s
     */
    public void insert(String s) {
        root = insert(root, s, 0);
    }
 
    /**
     * 返回三叉树大小
     * @return
     */
    public int size() {
        return count;
    }
 
    /**
     * 返回是否能够找到字符串s
     * @param s
     * @return boolean
     */
    public boolean contains(String s) {
        return search(root, s, 0) != null;
    }
    public int count(String s) {
        Node a= search(root, s, 0);
        if(a!=null){
            return a.co;
        }else
            return 0;
    }
 
    private Node search(Node ref, String s, int pos) {
        if (ref == null) {
            return null;
        } else {
            int cmp = s.charAt(pos) - ref.m_char;
            if (cmp < 0) {
                return search(ref.left, s, pos);
            } else if (cmp > 0) {
                return search(ref.right, s, pos);
            } else {
                if (1 + pos == s.length()) {
                    return ref;
                }
                return search(ref.middle, s, pos + 1);
            }
        }
    }
 
    private Node insert(Node ref, String s, int i) {
        if (ref == null) {
            count++;
            ref = new Node(s.charAt(i), false);
        }
        int cmp = s.charAt(i) - ref.m_char;
        if (cmp < 0) {
            ref.left = insert(ref.left, s, i);
        } else if (cmp > 0) {
            ref.right = insert(ref.right, s, i);
        } else {
            if (i + 1 == s.length()) {
                ref.end = true;
            } else {
                ref.middle = insert(ref.middle, s, i + 1);
            }
            ref.co++;
        }
        return ref;
 
    }
}
public class Main {
 
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        TernaryTree dic=new TernaryTree();
        Scanner inp=new Scanner(System.in);
        String a=new String();
        int mo=0;
        while(inp.hasNextLine()){
            a=inp.nextLine();
            if(a.equals("")){
                mo=1;
                continue;
            }
            if(mo==0)
            {
                dic.insert(a);
            }else
            {
                System.out.println(dic.count(a));
            }
        }
    }
}