    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>   
    using namespace std;
    using namespace __gnu_pbds;
    typedef long long ll; 
    #define int long long
    typedef unsigned long long lu;
    typedef vector<ll> v;
    typedef vector<vector<ll> > vv;
    typedef vector<string>  vs;
    typedef vector<pair<ll,ll>> vpr;
    typedef long double ld;
    #define f(i,n) for(ll i = 0; i < n; i++)
    #define ff(i,n) for(ll i=1;i<=n;i++)
    #define pb push_back
    #define mp make_pair
    #define endl "\n"
    #define fi first
    #define se second
    #define all(x) x.begin(),x.end()
    #define rall(x) x.rbegin(),x.rend()
    #define amax(x,y) if(y>x) x=y;
    #define amin(x,y) if(y<x)x=y;
    #define bg(x) x.begin()
    #define sz(x) (ll)x.size()
    #define in(x,n) for(ll i=0;i<n;i++)cin>>x[i]
    #define out(x,n) for(ll i=0;i<n;i++)cout<<x[i]<<" " 
    #define mxt(a) *(max_element(a.begin(),a.end()))
    #define mnt(a) *(min_element(a.begin(),a.end())
    #define tc ll t;cin>>t;while(t--)
    typedef pair<ll,ll> pi;
    #define yes cout<<"YES\n";
    #define no cout<<"NO\n";
    #define yesno(f) if(f) yes else no
    const v dx = {1, -1, 0, 0};
    const v dy = {0, 0, 1, -1};
    const ld PI = 2 * acos(0.0);
    ll cel(ll x1,ll y1){if((x1%y1)==0)return x1/y1;else return x1/y1+1;}
    ll power(ll a,ll b,ll m)
    {
        if(b==0)
            return 1;
        ll d=power(a,b/2,m);
        d=(d*d)%m;
        if(b&1)
            d=(d*a)%m;
        return d;
    }
    const ll mod=1e9+7;
    int MOD(int a)
    {
        if(a<0)
            a+=mod;
        if(a>=mod)
            a%=mod;
        return a;
    }
    // set_name.find_by_order(k) It returns to an iterator to the kth element (counting from zero) in the set in O(logn) time
    // set_name.order_of_key(k) It returns to the number of items that are strictly smaller than our item k in O(logn) time.
    /*string operations :
    str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
    str.substr (x) : returns a substring str[x],... end of string
    str.find(qtr) : returns the first occurenece of qtr in str */
    int32_t main()
    {
        ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
        int n;cin>>n;
        v powers(n+1,1);
        for(int i=1;i<=n;i++)
        {
            powers[i]=MOD(2*powers[i-1]);
        }
        map<pi,int>mapp;
        int both_zero=0;
        int y=0,x=0;
        for(int i=0;i<n;i++)
        {
            int a,b;cin>>a>>b;
            if(a==0 && b==0)
            {
                both_zero=1;
            }
            else if(a==0)
                y++;
            else if(b==0)
                x++;
            else
            {
                bool neg=false;
                if((a >0 && b < 0) || (a<0 && b>0))
                    neg=true;
                a=abs(a);
                b=abs(b);
                int g=__gcd(a,b);
                a/=g;
                b/=g;
                if(neg)
                    a=-a;
                mapp[{a,b}]++;
            }
        }
        int fans=powers[x]+powers[y]-1;
        map<pi,int>mapp2;
        for(auto it:mapp)
        {
            if(mapp2[it.fi])
                continue;
            int a=it.fi.fi,b=it.fi.se;
            int a1=b,b1=a;
            if(b1 < 0)
            {
                b1=-b1;
                a1=-a1;
            }
            a1=-a1;
            int A=it.se,B=mapp[{a1,b1}];
            // cout<<a<<" "<<b<<" "<<it.se<<" , "<<a1<<" "<<b1<<" "<<mapp[{a1,b1}]<<endl;
        int ans=0;
            ans+=(powers[A]+powers[B]-1);
            ans=MOD(ans);
            fans*=ans;
            fans=MOD(fans);
            mapp2[{a1,b1}]=1;
        }
        fans--;
        fans+=both_zero;
        fans=MOD(fans);
        cout<<fans<<endl;
        return 0;
    }