Han Solo and Lazer Gun

There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.

Han Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x0, y0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x0, y0).

Your task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.

The gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don’t have enough time to realize what’s happening and change their location.

Input
The first line contains three integers n, x0 и y0 (1 ≤ n ≤ 1000,  - 104 ≤ x0, y0 ≤ 104) — the number of stormtroopers on the battle field and the coordinates of your gun.

Next n lines contain two integers each xi, yi ( - 104 ≤ xi, yi ≤ 104) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.

Output
Print a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers.

Examples
Input
4 0 0
1 1
2 2
2 0
-1 -1
Output
2
Input
2 1 2
1 1
1 0
Output
1
Note
Explanation to the first and second samples from the statement, respectively:

就问需要开多少枪，斜率相同的点可以一枪打死，这是很好的set使用题。
注意特判斜率不存在的情况。

在这里插入代码片
#include"iostream"
#include"cstring"
#include"algorithm"
#include"set"
using namespace std;

int main()
{
	int n;
	double x,y;
	while(cin >> n >> x >> y)
	{
		double q,p;
		set<double>qqq;
		int flag = 0;
		for(int i = 0;i < n;i ++)
		{
			cin >>q >>p;
			if((q-x) == 0)
			{
				flag = 1;
				continue;
			}
			double h=(double)(p-y)/(q-x);
			qqq.insert(h);
			//cout<<h<<endl;
		}
		int m=qqq.size();
	//	cout<<m<<endl;
		if(flag)
		{
			m+=1;
		}
		cout<<m<<endl;
	}
	return 0;
}