#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
int ctoi(const char c) {
  if ('0' <= c && c <= '9') return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll INF = 1000000011;
constexpr ll MOD = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto&& x : v) is >> x;
  return is;
}
template <typename T, typename U>
istream& operator>>(istream& is, pair<T, U>& p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream& operator>>(ostream& os, const pair<T, U>& p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v)) os << ' ';
    os << *i;
  }
  return os;
}
ll N;
ll A, B;
map<pair<ll, ll>, ll> M, C;
ll cme;
ll modpow(ll b, ll e, ll m) {
  if (e == 0) return 1;
  cme = modpow(b, e / 2, m);
  cme = (cme * cme) % m;
  if (e % 2 == 1) cme = (cme * b) % m;
  return cme;
}
ll R, L, Q;
int main() {
  cin >> N;
  for (ll i = 0; i < (N); ++i) {
    ll A, B;
    cin >> A >> B;
    if (A == 0 && B == 0) {
      Q++;
      continue;
    } else if (A == 0) {
      L++;
      continue;
    } else if (B == 0) {
      R++;
      continue;
    }
    ll K = gcd(abs(A), abs(B));
    if (A < 0) {
      A *= -1;
      B *= -1;
    }
    A /= K;
    B /= K;
    M[make_pair(A, B)]++;
  }
  ll ANS = 1;
  for (auto P : M) {
    if (C[P.first] == 1) {
      continue;
    }
    ll S = P.first.first;
    ll T = P.first.second;
    if (T < 0) {
      S *= -1;
      T *= -1;
    }
    S *= -1;
    ll X = ((modpow(2, M[P.first], MOD) % MOD) +
            (modpow(2, M[make_pair(T, S)], MOD) % MOD) - 1 + MOD) %
           MOD;
    ANS *= X;
    ANS %= MOD;
    C[P.first] = 1;
    C[make_pair(T, S)] = 1;
  }
  ll X = (modpow(2, R, MOD) + modpow(2, L, MOD) - 1 + MOD) % MOD;
  ANS *= X;
  ANS %= MOD;
  ANS = (ANS + Q) % MOD;
  ANS = (ANS - 1 + MOD) % MOD;
  cout << ANS << '\n';
}
