<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<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b)) < EPS)
using namespace std;

class Point {
public:
    double x, y;

    Point(double x=0, double y=0): x(x), y(y) {}

    Point operator + (Point p) { return Point(x+p.x, y+p.y); }
    Point operator - (Point p) { return Point(x - p.x, y - p.y); }
    Point operator * (double a) { return Point(x*a, y*a); }
    Point operator / (double a) { return Point(x/ a, y/ a); }

    double abs() { return sqrt(norm()); }
    double norm() { return x*x, y*y; }
    bool operator < (const Point &p) const {
	return x != p.x ? x<p.x : y < p.y;
    }
    
    bool operator == (const Point &p) const {
	return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
    }
};

typedef Point Vector;

struct Segment {
    Point p0, p1;
};

typedef Segment Line;

double dot(Vector a, Vector b) {
    return a.x*b.x + a.y*b.y;
}

double norm(Vector a) {
    return a.x*a.x + a.y*a.y;
}

double abs(Vector a){
    return sqrt(norm(a));
}

/*
  ???????????§??????????????¨??????????????°??????
  |a*b|=|a||b|sin(theta)
 */
double cross(Vector a, Vector b){ 
    return a.x*b.y - a.y*b.x;
}
    
int main() {
    int n,i,d;
    
    Point p0, p1, p2;
    cin >> p0.x >> p0.y >> p1.x >> p1.y;
    cin >> n;
    for(i=0;i<n;i++){
	cin >>  p2.x >> p2.y;
	
	if (cross(p1-p0, p2-p0) > EPS) cout << "COUNTER_CLOCKWISE" << endl;
	else if (cross(p1-p0, p2-p0) < -EPS) cout << "CLOCKWISE" << endl;
	else if (dot(p1-p0, p2-p0)/ (abs(p1-p0)*abs(p2-p0)) + 1 < EPS) cout << "ONLINE_BACK" << endl;
	else if (abs(p2-p0) > abs(p1-p0)) cout << "ONLINE_FRONT" << endl;
	else cout << "ON_SEGMENT" << endl;

    }
    return 0;

}