// ---------- begin ModInt ----------
const MOD: u32 = 1_000_000_007;

#[derive(Clone, Copy)]
struct ModInt(u32);

impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}

impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}

impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32)
    }
}

impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}

impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 { 0 } else { MOD - self.0 })
    }
}

impl std::fmt::Display for ModInt {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl std::str::FromStr for ModInt {
    type Err = std::num::ParseIntError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let val = s.parse::<u32>()?;
        Ok(ModInt::new(val))
    }
}

impl From<usize> for ModInt {
    fn from(val: usize) -> ModInt {
        ModInt((val % MOD as usize) as u32)
    }
}

#[allow(dead_code)]
impl ModInt {
    pub fn new(n: u32) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: u32) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        assert!(self.0 > 0);
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------

fn run() {
    proconio::input! {
        n: usize,
        mut p: [(i64, i64); n],
    }
    let mut map = std::collections::BTreeMap::new();
    for p in p.iter_mut() {
        if p.0 == 0 || p.1 == 0 {
            if p.0 != 0 {
                p.0 = 1;
            }
            if p.1 != 0 {
                p.1 = 1;
            }
        } else {
            let g = num::integer::gcd(p.0.abs(), p.1.abs());
            if p.0 < 0 {
                p.0 = -p.0;
                p.1 = -p.1;
            }
            p.0 /= g;
            p.1 /= g;
        }
        *map.entry((p.0, p.1)).or_insert(0) += 1;
    }
    let mut ans = ModInt::one();
    let zero = map.remove(&(0, 0)).map_or(ModInt::zero(), |c| ModInt(c));
    while let Some((&key, &c)) = map.iter().next() {
        map.remove(&key);
        let p = if key.1 < 0 {
            (-key.1, key.0)
        } else {
            (key.1, -key.0)
        };
        if let Some(d) = map.remove(&p) {
            ans *= ModInt(2).pow(c) + ModInt(2).pow(d) - ModInt::one();
        } else {
            ans *= ModInt(2).pow(c);
        }
    }
    ans += zero - ModInt::one();
    println!("{}", ans);
}

fn main() {
    run();
}


Measured memory_bytes: 20052