Problem:
Score: 500 points

Problem Statement

We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.

We will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.

The i-th and j-th sardines (i \neq j) are on bad terms if and only if A_i \cdot A_j + B_i \cdot B_j = 0.

In how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

-10^{18} \leq A_i, B_i \leq 10^{18}

Input

Input is given from Standard Input in the following format:

N
A_1 B_1
:
A_N B_N

Output

Print the count modulo 1000000007.

Sample Input 1

3
1 2
-1 1
2 -1

Sample Output 1

5

There are five ways to choose the set of sardines, as follows:

The 1-st

The 1-st and 2-nd

The 2-nd

The 2-nd and 3-rd

The 3-rd

Sample Input 2

10
3 2
3 2
-1 1
2 -1
-3 -9
-8 12
7 7
8 1
8 2
8 4

Sample Output 2

479

Solution in Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;

public class Main{
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	final long MOD=1000000007;
	int MAX=(int)4e5;
	long[] p2=new long[MAX];
	{
		p2[0]=1;
		for (int i=1;i<p2.length;++i) p2[i]=p2[i-1]*2%MOD;
	}
	long gcd(long a,long b) {
		return a==0?b:gcd(b%a,a);
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		HashMap<List<Long>,Integer> p=new HashMap<>();
		HashMap<List<Long>,Integer> n=new HashMap<>();
		long zero=0;
		int azero=0;
		int bzero=0;
		for (int i=0;i<N;++i) {
			long A=sc.nextLong();
			long B=sc.nextLong();
			if (A==0 && B==0) ++zero;
			else if (A==0) ++azero;
			else if (B==0) ++bzero;
			else {
				long g=gcd(Math.abs(A),Math.abs(B));
				A/=g;B/=g;
				List<Long> add=List.of(Math.abs(A),Math.abs(B));
				if (Math.signum(A)*Math.signum(B)==1) {
					p.merge(add, 1, Integer::sum);
				} else {
					n.merge(add, 1, Integer::sum);
				}
			}
		}
		long ans2=1;
		for (var entry:p.entrySet()) {
			var vp=entry.getKey();
			var vn=List.of(vp.get(1),vp.get(0));
			if (n.containsKey(vn)) {
				ans2=ans2*(p2[entry.getValue()]+p2[n.get(vn)]+MOD-1)%MOD;
			} else {
				ans2=ans2*(p2[entry.getValue()])%MOD;
			}
		}
		for (var entry:n.entrySet()) {
			var vn=entry.getKey();
			var vp=List.of(vn.get(1),vn.get(0));
			if (!p.containsKey(vp)) {
				ans2=ans2*p2[entry.getValue()]%MOD;
			}
		}
		ans2=ans2*(p2[azero]+p2[bzero]+MOD-1)%MOD;
		System.out.println((ans2+MOD-1+zero)%MOD);
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}