<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
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C
#include <iostream>
#include <cmath>
#include <cstdio>

using namespace std;

class Point{
private:
    double x;
    double y;
public:
    void setPoint(double inX, double inY){x = inX; y = inY;};
    void disp(){printf("%.12f %.12f\n", x,y);}
    double length(){return x*x + y*y;};
    double cross(Point Q){return x*Q.y - Q.x*y;};
    double dot(Point Q){return x*Q.x + y*Q.y;};
};


//??????????????????2????????????????????¨????????±???
//P = P2-P1, Q = P - P1
void judge(Point P, Point Q){
    double Cval = P.cross(Q);
    if(Cval > 0) cout << "COUNTER_CLOCKWISE" << endl;
    else{
        if(Cval < 0) cout << "CLOCKWISE" << endl;
        else{
            double Dval = P.dot(Q);
            if(Dval < 0) cout << "ONLINE_BACK" << endl;
            else{
                if(P.length() >= Q.length()) cout << "ON_SEGMENT" << endl;
                else cout << "ONLINE_FRONT" << endl;
            }
        }
    }
}




int main(){
    int n;
    double a,b,c,d;
    Point P, Q;
    cin >> a >> b >> c >> d;
    P.setPoint(c-a, d-b);
    cin >> n;
    for(int i=0; i<n; i++){
        cin >> c >> d;
        Q.setPoint(c-a, d-b);
        judge(P,Q);
    }
    return 0;
}