<image>

For given three points p0, p1, p2, print


COUNTER_CLOCKWISE


if p0, p1, p2 make a counterclockwise turn (1),


CLOCKWISE


if p0, p1, p2 make a clockwise turn (2),


ONLINE_BACK


if p2 is on a line p2, p0, p1 in this order (3),


ONLINE_FRONT


if p2 is on a line p0, p1, p2 in this order (4),


ON_SEGMENT


if p2 is on a segment p0p1 (5).

Constraints

* 1 ≤ q ≤ 1000
* -10000 ≤ xi, yi ≤ 10000
* p0 and p1 are not identical.

Input


xp0 yp0 xp1 yp1
q
xp20 yp20
xp21 yp21
...
xp2q-1 yp2q-1


In the first line, integer coordinates of p0 and p1 are given. Then, q queries are given for integer coordinates of p2.

Output

For each query, print the above mentioned status.

Examples

Input

0 0 2 0
2
-1 1
-1 -1


Output

COUNTER_CLOCKWISE
CLOCKWISE


Input

0 0 2 0
3
-1 0
0 0
3 0


Output

ONLINE_BACK
ON_SEGMENT
ONLINE_FRONT
from math import sqrt
x0,y0,x1,y1 = map(int, input().split())
a = [x0,y0]
b = [x1, y1]
q = int(input())

CCW = {1: 'COUNTER_CLOCKWISE',
       2: 'CLOCKWISE',
       3: 'ONLINE_BACK',
       4: 'ONLINE_FRONT',
       5: 'ON_SEGMENT',}

def dot(a,b):
  return sum ([i * j for i, j in zip(a,b)])

def sub(a,b):
  return [a[0] - b[0], a[1] - b[1]]

def cross(a,b):
  return a[0] * b[1] - a[1] * b[0]

def _abs(a):
  return sqrt(a[0] ** 2 + a[1] ** 2)

def ccw(a, b, c):
  x = sub(b,a)
  y = sub(c,a)
  if cross(x, y) > 0:
    return 1
  if cross(x, y) < 0:
    return 2
  if dot(x,y)<0:
    return 3
  if _abs(x) < _abs(y):
    return 4
  return 5

for i in range(q):
  c = list(map(int, input().split()))
  print(CCW[ccw(a,b,c)])

