<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 <complex>
#include <algorithm>
using namespace std;

typedef long double Real;
typedef complex<Real> Point;
#define PCR Point const &
#define X real()
#define Y imag()

const Real EPS = 1e-10;
const Real INF = 1e100;
const Real PI = acos(-1);

struct Segment {
    Point p[2];
    Segment (PCR a = Point(), PCR b = Point()){
        p[0] = a, p[1] = b;
    }
    Point & operator [] (int k) { return p[k]; }
    Point const & operator [] (int k) const { return p[k]; }
};
typedef vector<Point> Polygon;
struct Circle { Real radius; Point center; };

Real dot(PCR a, PCR b){
    return a.X*b.X + a.Y*b.Y;
}
Real cross(PCR a, PCR b){
    return a.X*b.Y - a.Y*b.X;
}

Point pSP(Segment const & s, PCR p){
    Point base = s[1] - s[0];
    Real r = dot(p - s[0], base) / norm(base);
    return s[0] + base * r;
}

Point rSP(Segment const & s, PCR p){
    Point v = pSP(s,p) - p;
    return p + v * Real(2);
}

enum { LEFT = 1, RIGHT = -1, BACK = 2, FRONT = -2, ON = 0 };
int ccw(PCR x, PCR p, PCR q){
    // 端点を含む
    // コメントインすると端点を含まなくなる
    Point a = p - x, b = q - x;
    if(cross(a,b) > EPS) return LEFT;
    if(cross(a,b) < -EPS) return RIGHT;
    // if(abs(a) < EPS) return BACK;
    if(dot(a,b) < -EPS) return BACK;
    // if(abs(b) < EPS) return FRONT;
    if(norm(a) < norm(b)) return FRONT;
    return ON;
}

#include <iostream>
#include <cstdio>

int main(){
    Segment s;
    Real x,y;
    cin >> x >> y;
    s[0] = Point(x,y);
    cin >> x >> y;
    s[1] = Point(x,y);
    int q;
    cin >> q;
    for(int i=0;i<q;i++){
        cin >> x >> y;
        int c = ccw(s[0],s[1],Point(x,y));
        if(c==LEFT) puts("COUNTER_CLOCKWISE");
        if(c==RIGHT) puts("CLOCKWISE");
        if(c==BACK) puts("ONLINE_BACK");
        if(c==FRONT) puts("ONLINE_FRONT");
        if(c==ON) puts("ON_SEGMENT");
    }
}