<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
/*
w2sc
2019/12/19
19:32:08
*/
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
using namespace std;
const double EPS=1e-10;
struct Point{
    double x,y;
    Point(){}
    Point(double xx,double yy){x=xx,y=yy;}
    Point operator -(Point A){return Point(x-A.x,y-A.y);}
    Point operator +(Point A){return Point(x+A.x,y+A.y);}
    double operator ^(Point A){return x*A.y-y*A.x;}
    double operator *(Point A){return x*A.x+y*A.y;}
    double len(){return sqrt(x*x+y*y);}
};
typedef Point Vec;
Vec v,u;
Point A,B;
int main()
{
    scanf("%lf%lf",&A.x,&A.y);
    scanf("%lf%lf",&B.x,&B.y);
    v=B-A;
    int q;
    cin>>q;
    while(q--)
    {
        scanf("%lf%lf",&B.x,&B.y);
        u=B-A;
        if((v^u)>EPS) puts("COUNTER_CLOCKWISE");
        else if((v^u)<-EPS) puts("CLOCKWISE");
        else if(u*v<-EPS) puts("ONLINE_BACK");
        else if(u.len()>v.len()) puts("ONLINE_FRONT");
        else puts("ON_SEGMENT");
    }
    return 0;
}

