Problem:
Polygon-Point-Containment

For a given polygon g and target points t, print "2" if g contains t, "1" if t is on a segment of g, "0" otherwise.

g is represented by a sequence of points p1, p2,..., pn where line segments connecting pi and pi+1 (1 ≤ i ≤ n-1) are sides of the polygon. The line segment connecting pn and p1 is also a side of the polygon.

Note that the polygon is not necessarily convex.

Input

The entire input looks like:

g (the sequence of the points of the polygon)
q (the number of queris = the number of target points)
1st query
2nd query
:
qth query

g is given by coordinates of the points p1,..., pn in the following format:

n
x1 y1
x2 y2
:
xn yn

The first integer n is the number of points. The coordinate of a point pi is given by two integers xi and yi. The coordinates of points are given in the order of counter-clockwise visit of them.

Each query consists of the coordinate of a target point t. The coordinate is given by two intgers x and y.

Output

For each query, print "2", "1" or "0".

Constraints

3 ≤ n ≤ 100

1 ≤ q ≤ 1000

-10000 ≤ xi, yi ≤ 10000

No point of the polygon will occur more than once.

Two sides of the polygon can intersect only at a common endpoint.

Sample Input

4
0 0
3 1
2 3
0 3
3
2 1
0 2
3 2

Sample Output

2
1
0

Solution in Ruby (judge verdict: Accepted)

n = gets.to_i
p = []
n.times{|i|
  p[i] = gets.split.map(&:to_i)
}
p << p[0]
q = gets.to_i
q.times{
  x, y = gets.split.map(&:to_i)
  count = 0
  on_line = false
  n.times{|i|
    a = [p[i  ][0] - x, p[i  ][1] - y]
    b = [p[i+1][0] - x, p[i+1][1] - y]
    if  a[0]*b[1] - a[1]*b[0] == 0 && a[0]*b[0]+a[1]*b[1] <= 0
      on_line = true
      break
    end
    a, b = b, a if a[1] > b[1]
    count += 1 if a[1] <= 0 && b[1] > 0 && a[0]*b[1] - a[1]*b[0] > 0
  }
  if on_line == true
    puts "1"
  elsif count % 2 == 0
    puts "0"
  else
    puts "2"
  end
}