<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 <bits/stdc++.h>
using namespace std;

struct Point
{
	int x;
	int y;
};

bool inPoint(Point a, Point b, Point c)
{
	if(min(a.x,c.x)<=b.x && max(a.x,c.x)>=b.x && min(a.y,c.y)<=b.y && max(a.y,c.y)>=b.y) return true;
	return false;
}

int orientation(Point a, Point b, Point c)
{
	int val = (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
	//clockwise
	if(val<0) return -1;
	//counter
	else if(val>0) return 1;
	//collinear
	else return 0;
}

void turn(Point a, Point b, Point c)
{
	int val = orientation(a,b,c);
	if(val==-1) cout<<"CLOCKWISE"<<endl;
	else if(val==1) cout<<"COUNTER_CLOCKWISE"<<endl;
	else if(inPoint(a, c, b)) cout<<"ON_SEGMENT"<<endl;
	else if(inPoint(c, a, b)) cout<<"ONLINE_BACK"<<endl;
	else cout<<"ONLINE_FRONT"<<endl;
}

int main()
{
	int x1,y1,x2,y2;
	int q;
	cin>>x1>>y1>>x2>>y2;
	cin>>q;
	Point a = {x1,y1};
	Point b = {x2,y2};
	int x3,y3;
	for(int i=0;i<q;i++)
	{
		cin>>x3>>y3;
		Point c = {x3,y3};	
		turn(a,b,c);
	}
	return 0;
}

