<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() {
	
	int p0x,p0y,p1x,p1y,q;
	cin>>p0x>>p0y>>p1x>>p1y>>q;
	
	for(int i=0;i<q;++i){
		int x,y;
		cin>>x>>y;
		
		int crossp = (p1x-p0x) * (y-p0y) - (p1y-p0y) * (x-p0x);
		int dotp = (p1x-p0x) * (x-p0x) + (p1y-p0y) * (y-p0y);
		
		if(crossp>0)cout<<"COUNTER_CLOCKWISE"<<endl;
		else if(crossp<0)cout<<"CLOCKWISE"<<endl;
		else{
			if(dotp<0)cout<<"ONLINE_BACK"<<endl;
			else if( abs(p1x-p0x) >= abs(x-p0x) && abs(p1y-p0y) >= abs(y-p0y) )cout<<"ON_SEGMENT"<<endl;
			else cout<<"ONLINE_FRONT"<<endl;
		}
	}
	return 0;
}