<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<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;

double EPS = 1e-10;

double add(double a, double b){
	if(abs(a+b) < EPS * (abs(a) + abs(b))) return 0;
	return a+b;
}

struct P{
	double x,y;
	P(){}
	P(double x, double y) : x(x), y(y){
	}
	P operator +(P p){
		return P(add(x,p.x), add(y,p.y));
	}
	P operator -(P p){
		return P(add(x,-p.x), add(y,-p.y));
	}
	P operator *(double d){
		return P(d*x, d*y);
	}
	double dot (P p){
		return add(x*p.x, y*p.y);
	}
	double det (P p){
		return add(x*p.y, -y*p.x);
	}
	void print (){
		cout << x << " " << y <<endl;
		return;
	}
};

void clockWise(P p0, P p1, P p2){
	P q1 = p1-p0;
	P q2 = p2-p0;
	if(!q1.det(q2)){
		double r;
		if(q2.x == 0 && q2.y == 0 ) {
			cout << "ON_SEGMENT" <<endl;
			return ;
		}
		if(q2.x != 0) r =  q1.x/q2.x;
		if(q2.y != 0) r =  q1.y/q2.y;
		if(r<0){
			cout << "ONLINE_BACK"<< endl;
		}else if(r>=1){
			cout << "ON_SEGMENT"<<endl;
		}else{
			cout <<"ONLINE_FRONT" <<endl;
		}
	}else{
		if(q1.det(q2)>0){
			cout << "COUNTER_CLOCKWISE" <<endl;
		}else{
			cout <<"CLOCKWISE"<< endl;
		}

	}
	return;
}

int main(){
	double x, y, q;
	cin >> x >> y ;
	P p0(x,y);
	cin >> x >> y ;
	P p1(x,y);
	cin >> q ;

	for(int i=0;i<q;i++){
		cin >> x >> y ;
		P p2(x,y);
		clockWise(p0, p1, p2);
	}
	return 0;
}