#284 div.2 C.Crazy Town

C. Crazy Town

 

Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation a_ix + b_iy + c_i = 0, where a_i and b_i are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's call each such region a block. We define an intersection as the point where at least two different roads intersect.

Your home is located in one of the blocks. Today you need to get to the University, also located in some block. In one step you can move from one block to another, if the length of their common border is nonzero (in particular, this means that if the blocks are adjacent to one intersection, but have no shared nonzero boundary segment, then it are not allowed to move from one to another one in one step).

Determine what is the minimum number of steps you have to perform to get to the block containing the university. It is guaranteed that neither your home nor the university is located on the road.

Input

The first line contains two space-separated integers x₁, y₁ ( - 10⁶ ≤ x₁, y₁ ≤ 10⁶) — the coordinates of your home.

The second line contains two integers separated by a space x₂, y₂ ( - 10⁶ ≤ x₂, y₂ ≤ 10⁶) — the coordinates of the university you are studying at.

The third line contains an integer n (1 ≤ n ≤ 300) — the number of roads in the city. The following n lines contain 3 space-separated integers ( - 10⁶ ≤ a_i, b_i, c_i ≤ 10⁶; |a_i| + |b_i| > 0) — the coefficients of the line a_ix + b_iy + c_i = 0, defining the i-th road. It is guaranteed that no two roads are the same. In addition, neither your home nor the university lie on the road (i.e. they do not belong to any one of the lines).

Output

Output the answer to the problem.

Sample test(s)

Input

1 1
-1 -1
2
0 1 0
1 0 0

Output

2

Input

1 1
-1 -1
3
1 0 0
0 1 0
1 1 -3

Output

2

Note

Pictures to the samples are presented below (A is the point representing the house; B is the point representing the university, different blocks are filled with different colors):

POINT:

　　1.判断直线与线段是否相交即判断线段两端点是否在直线两侧；

　　注意此题不能直接判断，因为乘积可能long long越界；

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<string>
 #include<algorithm>
 #include<map>
 using namespace std;
 const int maxn = ;

 struct Node
 {
     long long x, y;
 }p1, p2;
 int n;
 int main()
 {
     scanf("%I64d%I64d%I64d%I64d", &p1.x, &p1.y, &p2.x, &p2.y);
     scanf("%d", &n);
     long long cnt = ;
     for(int i = ; i < n; i++)
     {
         long long a, b, c;
         scanf("%I64d%I64d%I64d", &a, &b, &c);
         long long t1 = (a*p1.x + b*p1.y + c);
         long long t2 = (a*p2.x + b*p2.y + c);
         //  此处不能直接判断： long long 越界 ！
         if( (t1> && t2<) || (t1< && t2>) )  cnt++;
     }
     printf("%I64d\n", cnt);
     return ;
 }