<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>
#define EPS 1e-10
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
using namespace std;

static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;

struct Point {
    double x,y;
    Point(){}
    Point(double x,double y): 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 k) {return Point{x*k,y*k};}
    Point operator/(double k) {return Point{x/k,y/k};}
    double norm(){return x*x+y*y;}
    double abs(){sqrt(norm());}
    bool operator == (const Point &p) const {return equals(x,p.x)&&equals(y,p.y);}
};

typedef Point P;

struct Segment {
    P p1,p2;
    Segment(){}
    Segment(P p1, P p2):p1(p1),p2(p2){}
};

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

int ccw(P p0, P p1, P p2) {
    P a = p1-p0; P b = p2-p0;
    if (cross(a,b) > EPS) return COUNTER_CLOCKWISE;
    if (cross(a,b) < -EPS) return CLOCKWISE;
    if (dot(a,b) < -EPS) return ONLINE_BACK;
    if (a.norm() < b.norm()) return ONLINE_FRONT;
    return ON_SEGMENT;
}

int main() {
    map<int, string> mp;
    mp[COUNTER_CLOCKWISE] = "COUNTER_CLOCKWISE";
    mp[CLOCKWISE] = "CLOCKWISE";
    mp[ONLINE_BACK] = "ONLINE_BACK";
    mp[ONLINE_FRONT] = "ONLINE_FRONT";
    mp[ON_SEGMENT] = "ON_SEGMENT";
    double x0,y0,x1,y1;
    cin>>x0>>y0>>x1>>y1;
    P p0(x0,y0), p1(x1,y1);
    int q; cin>>q;
    rep(i,q) {
        double x2,y2;
        cin>>x2>>y2;
        P p2(x2,y2);
        cout << mp[ccw(p0,p1,p2)] << endl;
    }
}
