<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 <bits/stdc++.h>
using namespace std;

class vec{
public:
	double x,y;
	vec(){
		x = y = 0.0;
	}
	vec(double x,double y){
		this->x = x;
		this->y = y;
	}
	vec operator+(vec &r) const{
		return vec(x+r.x,y+r.y);
	}
	vec operator-(vec &r) const{
		return vec(x-r.x,y-r.y);
	}
	void operator=(vec &r){
		this->x = r.x;
		this->y = r.y;
	}
	double norm2(){
		return x*x+y*y;	
	}
};

double dot(vec v,vec u){
	return v.x*u.x + v.y*u.y;
}
double closs(vec v,vec u){
	return v.x*u.y - v.y*u.x;
}


int main(){
	vec p0,p1,p2;
	int q;
	cin >> p0.x >> p0.y >> p1.x >> p1.y;
	cin >> q;
	for(int i = 0; i < q; i++){
		cin >> p2.x >> p2.y;
		vec v = p1 - p0;
		vec u = p2 - p0;
		double cl = closs(u,v);
		if(cl < 0){
			cout << "COUNTER_CLOCKWISE" << endl;
		}
		else if (cl > 0){
			cout << "CLOCKWISE" << endl;
		}
		else if (cl == 0){
			double dt = dot(u,v);
			if(dt < 0){
				cout << "ONLINE_BACK" << endl;
			}
			else if (u.norm2() > v.norm2()){
				cout << "ONLINE_FRONT" << endl;
			}
			else{
				cout << "ON_SEGMENT" << endl;
			}
		}
	}

	return 0;
}

