<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>

#define reint register int
#define coint const int

using namespace std;

const double EPS = 1e-8;

struct Vector {
    double x, y;

    inline Vector operator+(const Vector &v) const {
        return (Vector){ x + v.x, y + v.y };
    }

    inline double dot(const Vector &v) const { return x * v.x + y * v.y; }
    inline double cross(const Vector &v) const { return x * v.y - y * v.x; }
    inline double length(void) const { return sqrt(x * x + y * y); }
    inline double square(void) const { return x * x + y * y; }

    inline Vector operator*(const double a) const {
        return (Vector){ x * a, y * a };
    }
};

struct Point {
    double x, y;

    inline Vector operator-(const Point &p) const {
        return (Vector){ x - p.x, y - p.y };
    }

    inline Point operator+(const Vector &v) const {
        return (Point){ x + v.x, y + v.y };
    }
};

inline int isEq(const double a, const double b) {
    return abs(a - b) < EPS;
}

int main(void) {
    Point p0, p1;
    scanf("%lf%lf%lf%lf", &p0.x, &p0.y, &p1.x, &p1.y);
    const Vector vec01 = p1 - p0;
    int q;
    scanf("%d", &q);
    for (reint i = 1; i <= q; ++i) {
        Point p2;
        scanf("%lf%lf", &p2.x, &p2.y);
        const Vector vec02 = p2 - p0;
        const double cross = vec01.cross(vec02);
        if (isEq(cross, 0)) {
            if (vec01.dot(vec02) + EPS < 0)
                puts("ONLINE_BACK");
            else if (vec01.square() + EPS < vec02.square())
                puts("ONLINE_FRONT");
            else puts("ON_SEGMENT");
        } else if (cross < 0)
            puts("CLOCKWISE");
        else puts("COUNTER_CLOCKWISE");
    }

    return 0;
}

