<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<iostream>
using namespace std;

struct Point{
    long x;
    long y;
    Point(double x, double y) : x(x), y(y) {}
};
typedef Point Vector;
long get_dot(Vector v1, Vector v2){
    return v1.x * v2.x + v1.y * v2.y;
}
long get_cross(Vector v1, Vector v2){
    return v1.x * v2.y - v1.y * v2.x;
}

int main(){
    int x_p0, y_p0, x_p1, y_p1;
    cin >> x_p0 >> y_p0 >> x_p1 >> y_p1;
    Vector v1(x_p1 - x_p0, y_p1 - y_p0);
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        int x_p2, y_p2;
        cin >> x_p2 >> y_p2;
        Vector v2(x_p2 - x_p0, y_p2 - y_p0);
        double cross = get_cross(v1, v2);
        if (cross > 0) {
            cout << "COUNTER_CLOCKWISE" << endl;
            continue;
        }
        if (cross < 0) {
            cout << "CLOCKWISE" << endl;
            continue;
        }
        long dot = get_dot(v1, v2);
        if (dot < 0) {
            cout << "ONLINE_BACK" << endl;
            continue;
        }
        long norm1 = get_dot(v1, v1);
        long norm2 = get_dot(v2, v2);
        if (norm1 < norm2) {
            cout << "ONLINE_FRONT" << endl;
            continue;
        }
        cout << "ON_SEGMENT" << endl;
    }
    return 0;
}

