<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>
using namespace std;
struct point
{
    double x,y;
};
double dist(point a,point b)
{
    return (sqrt((((b.x-a.x)*(b.x-a.x))+((b.y-a.y)*(b.y-a.y)))));
}
int orientation(point a,point b,point c)
{
    double val=((b.y-a.y)*(c.x-b.x))-((c.y-b.y)*(b.x-a.x));
    if(val==0)
    {
        if(dist(a,c)+dist(c,b)==dist(a,b))
            return 0;
        else if(dist(a,c)>dist(c,b))
            return 1;
        else
            return 2;
    }
    return (val>0)? 3:4;
}
int main()
{
    int t,res;
    double x1,y1,x2,y2,x3,y3;
    point p,q,r;
    cin>>x1>>y1>>x2>>y2;
    p.x=x1;
    p.y=y1;
    q.x=x2;
    q.y=y2;
    cin>>t;
    while(t--)
    {
        cin>>x3>>y3;
        r.x=x3;
        r.y=y3;
        res=orientation(p,q,r);
        if(res==0)
        {
            cout<<"ON_SEGMENT"<<endl;
        }
        else if(res==1)
        {
            cout<<"ONLINE_FRONT"<<endl;
        }
        else if(res==2)
        {
            cout<<"ONLINE_BACK"<<endl;
        }
        else if(res==3)
        {
            cout<<"CLOCKWISE"<<endl;
        }
        else if(res==4)
        {
            cout<<"COUNTER_CLOCKWISE"<<endl;
        }
    }

}

