问题遇到的现象和发生背景
Given an array of integers $A[0..n-1]$ and $m$ queries $b_j$.For each query report is th number $b_j$ is one of elements in $A$.InputThe first input line contains integer $n$ ($1 \le n \le 500$).
Next line contains $n$ integer numbers $A[0..n-1]$ ($0 \le A[i] \le 1000$).The third line contains integer $m$ ($1 \le m \le 500$).
Each of next $m$ lines contains query $b_j$.OutputFor each query output FOUND if required number is in array or MISSED otherwise
输入输出
standard input
5
1 2 3 4 5
5
1
2
6
0
5
standard output
FOUND
FOUND
MISSED
MISSED
FOUND
standard input
5
1 2 1 2 1
5
1
2
1
2
3
standard output
FOUND
FOUND
FOUND
FOUND
MISSED