<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<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<complex>
using namespace std;

int main(){
	cout << fixed << setprecision(10);
	const long double EPS=1e-8;
	long double Re,Im;
	int q;
	complex<long double>p1,p2;
	
	cin>>Re>>Im;
	p1.real(Re);
	p1.imag(Im);
	cin>>Re>>Im;
	p2.real(Re);
	p2.imag(Im);
	cin>>q;
	
	for(int i=0;i<q;i++){
		cin>>Re>>Im;
		complex<long double>tmp(Re,Im),p1_copy=p1,p2_copy=p2;
		
		
		tmp-=p1_copy;
		p2_copy-=p1_copy;
		complex<long double>p1_re=p1_copy;
		p1_copy-=p1_copy;
		tmp=tmp/p2_copy;
		complex<long double>p2_re=p2_copy;
		p2_copy=p2_copy/p2_copy;
      
        

		if(tmp.imag()>EPS){
			cout<<"COUNTER_CLOCKWISE"<<endl;
		}else if(tmp.imag()<-EPS){
			cout<<"CLOCKWISE"<<endl;
		}else if(tmp.real()<p1_copy.real()){
			cout<<"ONLINE_BACK"<<endl;
			
		}else if(tmp.real()<=p2_copy.real()){
			cout<<"ON_SEGMENT"<<endl;
		}else{
			cout<<"ONLINE_FRONT"<<endl;
		}
	}
	
}
