def solve():
n, x0, y0 = map(int, input().split())
k = set()
for i in range(n):
x, y = map(int, input().split())
if x == x0:
k.add(1010101010101010)
else:
k.add((y - y0) / (x - x0))
print(len(k))
solve()#include <bits/stdc++.h>
using namespace std;
int main(){
int n, x, y;
scanf("%d %d %d", &n, &x, &y);
map<pair<int, int>, int> m;
for(int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
a -= x;
b -= y;
int g = __gcd(a, b);
a /= g;
b /= g;
if(b < 0){
a = -a;
b = -b;
}
m[{a, b}] = 1;
}
printf("%d\n", m.size());
return 0;
}
432D - Prefixes and Suffixes | 486A - Calculating Function |
1373B - 01 Game | 1187A - Stickers and Toys |
313B - Ilya and Queries | 579A - Raising Bacteria |
723A - The New Year Meeting Friends | 302A - Eugeny and Array |
1638B - Odd Swap Sort | 1370C - Number Game |
1206B - Make Product Equal One | 131A - cAPS lOCK |
1635A - Min Or Sum | 474A - Keyboard |
1343A - Candies | 1343C - Alternating Subsequence |
1325A - EhAb AnD gCd | 746A - Compote |
318A - Even Odds | 550B - Preparing Olympiad |
939B - Hamster Farm | 732A - Buy a Shovel |
1220C - Substring Game in the Lesson | 452A - Eevee |
1647B - Madoka and the Elegant Gift | 1408A - Circle Coloring |
766B - Mahmoud and a Triangle | 1618C - Paint the Array |
469A - I Wanna Be the Guy | 1294A - Collecting Coins |