<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>
#include<algorithm>

using namespace std;

int main()
{
	double p1x, p1y, p2x, p2y, p0x, p0y;
	int q;

	scanf("%lf %lf %lf %lf", &p0x, &p0y, &p1x, &p1y);

	pair<double, double> v01 = { p1x - p0x, p1y - p0y };


	scanf("%d", &q);

	for (int i = 0; i < q; i++)
	{
		scanf("%lf %lf", &p2x, &p2y);

		if ((p2x == p0x && p2y == p0y) || (p2x == p1x && p2y == p1y)){
			printf("ON_SEGMENT\n");

			continue;
		}

		pair<double, double> v02 = { p2x - p0x, p2y - p0y };

		if (v01.first*v02.second == v01.second*v02.first)
		{
			if ((v01.first*v02.first < 0)||(v01.second*v02.second<0))
			{
				printf("ONLINE_BACK\n");
				continue;
			}
			else
			{
				if (pow(v01.first,2)+pow(v01.second,2)<pow(v02.first,2)+pow(v02.second,2)){
					printf("ONLINE_FRONT\n");
				}
				else{
					printf("ON_SEGMENT\n");
				}
				continue;
			}
		}
		double sin = (v01.first*v02.second - v01.second*v02.first);

		if (sin > 0){
			printf("COUNTER_CLOCKWISE\n");

			continue;
		}
		else{
			printf("CLOCKWISE\n");

			continue;
		}
	}
}