import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

tailrec fun gcd(a: Long, b: Long): Long {
  if (a < b) return gcd(b, a)
  if (b == 0L) return a
  return gcd(b, a % b)
}
data class Key(val a: Long, val b: Long)
data class Entry(val a: Long, val b: Long)
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val E = Array(N){ Entry(nl(), nl()) }
    val map = mutableMapOf<Key, Int>()
    var zeroCnt = 0

    val pow = LongArray(500_000)
    pow[0] = 1
    for (i in 1 until pow.size) {
      pow[i] = pow[i - 1] * 2 % MOD
    }

    fun normalize(a: Long, b: Long): Key {
      return when {
        a == 0L -> Key(0, 1)
        b == 0L -> Key(1, 0)
        else -> {
          val d = gcd(abs(a), abs(b))
          val sign = if (a > 0) 1 else -1
          Key(sign * a / d, sign * b / d)
        }
      }
    }

    for (e in E) {
      if (e.a == 0L && e.b == 0L) {
        zeroCnt++
        continue
      }

      val k = normalize(e.a, e.b)
      map.merge(k, 1, Int::plus)
    }
    debug{map.toString()}
    val counted = mutableSetOf<Key>()
    var ans = 1L
    for ((key, cnt) in map) {
      if (counted.contains(key)) continue

      val opposite = normalize(key.b, -key.a)
      val cnt_opposite = map.getOrDefault(opposite, 0)
      debug{"key:$key cnt:$cnt opposite:$opposite cnt_opposite:$cnt_opposite"}
      val v = (MOD + pow[cnt] + pow[cnt_opposite] - 1) % MOD
      ans = ans * v % MOD
      counted += key
      counted += opposite
    }
    ans = (ans + zeroCnt) % MOD
    ans = (MOD + ans - 1) % MOD
    out.println(ans)
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}


Measured memory_bytes: 110016