#[allow(dead_code)]
fn is_whitespace(c: &char) -> bool {
    c.is_whitespace()
}

#[allow(dead_code)]
fn is_eol(c: &char) -> bool {
    ['\r', '\n'].contains(c)
}

#[allow(unused_macros)]
macro_rules! input {
    ($var:ident, $($r:tt)*) => {
        input_inner!{$var, $($r)*}
    };

    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        #[allow(unused_mut, unused_variables, bare_trait_objects)]
        let mut next = move |f: &Fn(&char)->bool| -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|f(&c))
                .take_while(|c|!f(&c))
                .collect()
        };
        input_inner!{next, $($r)*};
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; eol ]) => {
        $next(&is_eol).split(' ').map(|x| x.parse::<$t>().unwrap()).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, parser) => {
        $next
    };

    ($next:expr, $t:ty) => {
        $next(&is_whitespace).parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap, HashSet};

#[allow(dead_code)]
struct Edge {
    from: usize,
    to: usize,
}

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;
#[allow(dead_code)]
const M: usize = 1_000_000_007;

fn gcd(a: usize, b: usize) -> usize {
    if b != 0 {
        gcd(b, a % b)
    } else {
        a
    }
}

fn main() {
    input! {
        n: usize,
        ab: [(i64, i64); n],
    }

    let mut hash1 = HashMap::new();
    let mut done = HashSet::new();
    let mut left = 0;
    let mut right = 0;
    let mut zeros = 0;

    for (a, b) in ab {
        if a > 0 && b > 0 || a < 0 && b < 0 {
            let g = gcd(a.abs() as usize, b.abs() as usize) as i64;
            *hash1.entry((a.abs() / g, b.abs() / g)).or_insert(0) += 1;
        } else if a > 0 && b < 0 || a < 0 && b > 0 {
            let g = gcd(a.abs() as usize, b.abs() as usize) as i64;
            *hash1.entry((-a.abs() / g, b.abs() / g)).or_insert(0) += 1;
        } else {
            if a == 0 && b != 0 {
                left += 1;
            } else if a != 0 && b == 0 {
                right += 1;
            } else {
                zeros += 1;
            }
        }
    }

    let mut ans = 1;
    let mut p2 = vec![1];
    for i in 0..n + 1 {
        let v = p2[i];
        p2.push(v * 2 % M);
    }
    ans += M + p2[left] - 1 + p2[right] - 1;
    ans %= M;

    for (&k, &v) in &hash1 {
        let mut mul = 1;
        let (a, b) = k;
        if done.get(&k).is_some() {
            continue;
        }
        mul += M + p2[v] - 1;
        mul %= M;
        if a > 0 && b > 0 {
            mul += M + p2[*hash1.get(&(-b, a)).unwrap_or(&0)] - 1;
        } else {
            mul += M + p2[*hash1.get(&(b, -a)).unwrap_or(&0)] - 1;
        }
        mul %= M;
        ans *= mul;
        ans %= M;
        //println!("{:?} {} {}", k, v, mul);
        if a > 0 && b > 0 {
            done.insert((-b, a));
        } else {
            done.insert((b.abs(), a.abs()));
        }
    }

    ans = (ans + M - 1) % M;
    println!("{}", (ans + zeros) % M);
}


Measured memory_bytes: 18700