import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = (1 << 63)-1 inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 class Vector: def __init__(self, x, y, init_x=1, init_y=0): self.x = x self.y = y self.norm2 = x*x+y*y self.norm = self.norm2**0.5 self.zone = 2 if x == y == 0: self.zone = -1 elif init_x*y-init_y*x > 0: self.zone = 1 elif init_x*y-init_y*x < 0: self.zone = 3 elif init_x*x+init_y*y > 0: self.zone = 0 def __repr__(self): return "({},{})".format(self.x, self.y) def __eq__(self, other): if self.zone != other.zone: return False return self.outer(other) == 0 def __lt__(self, other): if self.zone == other.zone: return self.outer(other) > 0 return self.zone < other.zone def __add__(self, other): return Vector(self.x+other.x, self.y+other.y) def __sub__(self, other): return Vector(self.x-other.x, self.y-other.y) def __iadd__(self, other): self.x += other.x self.y += other.y return self def __isub__(self, other): self.x -= other.x self.y -= other.y return self def __neg__(self): return Vector(-self.x, -self.y) def __mul__(self, val): return Vector(val*self.x, val*self.y) __rmul__ = __mul__ def __truediv__(self, val): assert val != 0 return Vector(self.x/val, self.y/val) def dot(self, v): return self.x*v.x+self.y*v.y def outer(self, v): return self.x*v.y-self.y*v.x def rot90(self): return Vector(-self.y, self.x) def area(polygon): res = 0 for i in range(len(polygon)): [x1, y1], [x2, y2] = polygon[i-1], polygon[i] res += x1*y2-x2*y1 return abs(res) from math import gcd n = II() vv = [] for _ in range(n): a, b = LI() if a == 0 and b == 0: continue v = Vector(a, b) if v.zone > 1: v = -v vv.append(v) if not vv: print(1) exit() vv.sort() # pDB(vv) n = len(vv) s = Vector(0, 0) pre = [(0, 0)] for i in range(n): s += vv[i] pre.append((s.x, s.y)) s = Vector(0, 0) pos = [] for i in range(n-1, 0, -1): s += vv[i] pos.append((s.x, s.y)) xy = pre+pos[::-1] # pDB(xy) b = 0 for i in range(len(xy)): dx = xy[i-1][0]-xy[i][0] dy = xy[i-1][1]-xy[i][1] b += gcd(dx, dy) s2 = area(xy) # pDB(b,s2) ans = (s2+b+2)//2%md print(ans)