<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<cstdio>
#include<complex>

#define Re real()
#define Im imag()

using namespace std;

typedef complex<double> Point;
typedef complex<double> Vector;

double dot(const Point& a, const Point& b)
{
    return (conj(a)*b).Re;
}

double cross(const Point& a,const Point& b)
{
    return (conj(a)*b).Im;
}

int main()
{
    int vol;
    double x1,x2,y1,y2;
    while(~scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2))
    {
        Point p0 = Point(x1,y1),p1 = Point(x2,y2);
        Vector v0 = p1 - p0;
        scanf("%d",&vol);
        while(vol--)
        {
            double tx,ty;
            scanf("%lf%lf",&tx,&ty);
            Point Pn = Point(tx,ty);
            Vector v1 = Pn - p0;
            double ans = cross(v1,v0);
            if(ans < 0) printf("COUNTER_CLOCKWISE\n");
            else if(ans > 0) printf("CLOCKWISE\n");
            else
            {
                int tmp = dot(v1,v0);
                if(tmp < 0) printf("ONLINE_BACK\n");
                else
                {
                    if(norm(v1) > norm(v0)) printf("ONLINE_FRONT\n");
                    else printf("ON_SEGMENT\n");
                }
            }
        }
    }
    return 0;
}