<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 <iostream>
#include <cmath>
using namespace std;

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;
	int X1 = x1 - x0, Y1 = y1 - y0;
	int q; cin >> q;
	while (q--) {
		int x2, y2; cin >> x2 >> y2;
		int X2 = x2 - x0, Y2 = y2 - y0;
		long long cross = X1*Y2 - Y1*X2;
		if (cross > 0) { cout << "COUNTER_CLOCKWISE" << endl; continue; }
		if (cross < 0) { cout << "CLOCKWISE" << endl; continue; }
		//??????????????§cross == 0 ?????????????¢????
		long long dot = X1*X2 + Y1*Y2;
		if (dot < 0) { cout << "ONLINE_BACK" << endl; continue; }
		//???????????§????????????ONLINE_FRONT???ON_SEGMENT
		//???????????????????¨????????????¨?????????????????????????????????????????§???????????±???????????????
		long long dis1 = X1/hypot(X1,Y1) * X1 + Y1/hypot(X1,Y1)*Y1, dis2 = X2/hypot(X2,Y2)*X2 + Y2/hypot(X2,Y2)*Y2;
		if (dis1 < dis2) { cout << "ONLINE_FRONT" << endl; continue; }
		cout << "ON_SEGMENT" << endl;
	}
}