<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
#include <cstdio>
#include <cmath>
struct point{
	double x, y;
	point(double _x = 0, double _y = 0){ x = _x, y = _y; }
	void read(){ scanf("%lf%lf", &x, &y); }
	void print(char ch = '\n'){ printf("%.10lf %.10lf", x, y), putchar(ch); }
	point operator + (const point &rhs) const { return point(x + rhs.x, y + rhs.y); }
	point operator - (const point &rhs) const { return point(x - rhs.x, y - rhs.y); }
}A, B, C;
int q;
double dot_product(point a, point b){
	return a.x * b.x + a.y * b.y;
}
double cross_product(point a, point b){
	return a.x * b.y - a.y * b.x;
}
int main(){
	A.read(), B.read();
	scanf("%d", &q);
	for (register int i = 1; i <= q; ++i){
		C.read();
		if (cross_product(B - A, C - A) > 0) puts("COUNTER_CLOCKWISE");
		else if (cross_product(B - A, C - A) < 0) puts("CLOCKWISE");
		else if (dot_product(B - A, C - A) < 0) puts("ONLINE_BACK");
		else if (dot_product(B - A, B - A) < dot_product(C - A, C - A)) puts("ONLINE_FRONT");
		else puts("ON_SEGMENT");
	}
}
