PROGRAMMING:Hash table lookup

Let hash table a [18], hash function is hash (k) = k% 17, using open address method to solve the conflict. In case of conflict, the square detection method is used, and the incremental sequence Di = I * I is used. The hash address corresponding to the input sequence is calculated and searched. If there is such an element, the hash address is output. If there is no such element, not found is output（ The number of entries will not exceed 15)
###Input format:
The first line is to input the number;
The input values corresponding to the second line are separated by spaces;
The third is the element to be searched, the first is the number of searching elements, followed by the number of searching elements
###Output format:
The first line outputs the hash address of the input sequence, separated by a space;
The second line starts to output the hash address of the search element. Each element occupies one line, and each line corresponds to a value and its hash address, separated by a space (that is, there is a space before and after POS). If there is no such element, the output is not found.
###Input example:
```in
four
57 75 91 108
2 108 20
```
###Output example:
```out
6 7 10 15
108 pos: 15
20 not found
```







answer：If there is no answer, please comment