<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>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

struct Point {
    long long int x, y;
};

string signed_area(int xp2, int yp2, Point p0, Point p1){
    double area2;
    area2 = (p0.x - xp2) * (p1.y - yp2) - (p0.y - yp2) * (p1.x - xp2);
    Point vec1, vec2;
    vec1.x = (p1.x-p0.x);
    vec1.y = (p1.y-p0.y);
    vec2.x = (xp2-p0.x);
    vec2.y = (yp2-p0.y);
    double naiseki;
    naiseki = vec1.x * vec2.x + vec1.y * vec2.y;
    //cout << "areea2:" << area2 << endl;
    //cout << naiseki << endl;
    if(area2 > 0){
        return "COUNTER_CLOCKWISE";
    }
    else if(area2 < 0){
        return "CLOCKWISE";
    }
    else {
        if(naiseki < 0){
            return "ONLINE_BACK";
        }
        else if(naiseki > 0){
            double leng1, leng2;
            leng1 = (p1.x-p0.x)*(p1.x-p0.x)+(p1.y-p0.y)*(p1.y-p0.y);
            leng2 = (xp2-p0.x)*(xp2-p0.x)+(yp2-p0.y)*(yp2-p0.y);
            if(leng1 < leng2){
                return "ONLINE_FRONT";
            }
            else {
                return "ON_SEGMENT";
            }
        }
        else {
            return "ON_SEGMENT";
        }
    }
}


int main() {
    Point p0, p1;
    cin >> p0.x >> p0.y >> p1.x >> p1.y;
    int q;
    cin >> q;
    vector<string> str;
    for(int i = 0; i < q; i++){
        int xp2, yp2;
        cin >> xp2 >> yp2;
        //cout << signed_area(xp2, yp2, p0, p1) << endl;
        str.push_back(signed_area(xp2, yp2, p0, p1));
    }

    for(int i = 0; i < q; i++){
        cout << str[i] << endl;
    }
}
