Frame-workout 2

Input

The input file contains a number $N$ (2 \leq N \leq 100) and the adjacency matrix of a complete undirected weighted graph (a complete graph is a graph in which there are edges between all pairs of vertices). All edge weights are natural numbers from $1$ to $1000$. Then, $N$ numbers are given, each either $0$ or $1$—these numbers are assigned to the vertices. It is guaranteed that there is at least one $0$ and at least one $1$.

Output

Find and print two vertices such that:

• the first vertex is assigned $0$

• the second vertex is assigned $1$

• the edge connecting these two vertices has the minimal possible weight

If there are multiple such pairs, output any of them.

Examples