<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 <cstring>
#include <cmath>
#include <vector>
#define EPS 1e-10
using namespace std;

struct P{
	double x,y;
	P(double xx=0,double yy=0){
		x=xx;
		y=yy;
	}
	P operator +(P &p){
		return P(x+p.x,y+p.y);	
	}
	P operator -(P &p){
		return P(x-p.x,y-p.y);	
	}
	P operator *(double d){
		return P(x*d,y*d);	
	}
	P operator /(double d){
		return P(x/d,y/d);	
	}
	double abs(){
		return sqrt(norm());
	}
	double norm(){
		return x*x+y*y;
	}
	bool operator ==(const P &p)const{
		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
	}
	double dot(P p){
		return x*p.x+y*p.y;
	}
	double cross(P p){
		return x*p.y-y*p.x;
	}
};

typedef P Vector;

int ccw(P p0,P p1,P p2){
	Vector a=p1-p0;
	Vector b=p2-p0;
	if(a.cross(b)>EPS)return 1;
	if(a.cross(b)<-EPS)return -1;
	if(a.dot(b)<-EPS)return 2;
	if(a.norm()<b.norm())return -2;
	return 0;
}

int main(void){
	P p0,p1,p2;
	scanf("%lf %lf %lf %lf",&p0.x,&p0.y,&p1.x,&p1.y);
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		scanf("%lf %lf",&p2.x,&p2.y);
		int res=ccw(p0,p1,p2);
		if(res==2)printf("ONLINE_BACK\n");
		if(res==1)printf("COUNTER_CLOCKWISE\n");
		if(res==0)printf("ON_SEGMENT\n");
		if(res==-1)printf("CLOCKWISE\n");
		if(res==-2)printf("ONLINE_FRONT\n");
	}
	return 0;
}