Problem:
Lexicographical Comparison

Compare given two sequence $A = \{a_0, a_1, ..., a_{n-1}\}$ and $B = \{b_0, b_1, ..., b_{m-1}$ lexicographically.

Input

The input is given in the following format.

$n$
$a_0 \; a_1, ..., \; a_{n-1}$
$m$
$b_0 \; b_1, ..., \; b_{m-1}$

The number of elements in $A$ and its elements $a_i$ are given in the first and second lines respectively.
The number of elements in $B$ and its elements $b_i$ are given in the third and fourth lines respectively. All input are given in integers.

Output

Print 1 $B$ is greater than $A$, otherwise 0.

Constraints

$1 \leq n, m \leq 1,000$

$0 \leq a_i, b_i \leq 1,000$

Sample Input 1

3
1 2 3
2
2 4

Sample Output 1

1

Sample Input 2

4
5 4 7 0
5
1 2 3 4 5

Sample Output 2

0

Sample Input 3

3
1 1 2
4
1 1 2 2

Sample Output 3

1

Solution in Ruby (judge verdict: Wrong Answer)

a = gets.to_i
ary1 = gets.split.map(&:to_i)
b = gets.to_i
ary2 = gets.split.map(&:to_i)

(0..[a,b].max-1).each do |i|
  if !ary1[i] || ary1[i] < ary2[i]
    puts 1
    break
  elsif !ary2[i] || ary1[i] > ary2[i]
    puts 0
    break
  elsif !ary1[i+1] && !ary2[i+1]
    puts 1
    break
  else
    next
  end
end