-----Problem-----

Suppose there is a circle. There are N Juice shops on that circle. Juice shops are numbered 0 to N-1 (both inclusive). You have two pieces of information corresponding to each of the juice shop:
(1) the amount of Juice that a particular Juice shop can provide and 
(2) the distance from that juice shop to the next juice shop.

Initially, there is a man with a bottle of infinite capacity carrying no juice. He can start the tour at any of the juice shops. Calculate the first point from where the man will be able to complete the circle. Consider that the man will stop at every Juice Shop. The man will move one kilometer for each litre of the juice.

-----Input-----
- 
The first line will contain the value of N.
				
- 
The next N lines will contain a pair of integers each, i.e. the amount of juice that a juice shop can provide(in litres) and the distance between that juice shop and the next juice shop.
				

-----Output-----

An integer which will be the smallest index of the juice shop from which he can start the tour.
		

-----Constraints-----
- 
					1 ≤ N ≤ 105
- 
					1 ≤ amt of juice, distance  ≤ 109

-----Sample Input-----
3

1 5

10 3

3 4

-----Sample Output-----
1

-----Explanation-----

			He can start the tour from the SECOND Juice shop.
		 p { text-align:justify }

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "import re,sys\ndef isCirlePossible(juices,distances):\n if juices == [] or distances == []:\n  return -1;\n total_juice_consumed = 0\n juice_consumed = 0\n start=0\n for i in range(0,len(juices)):\n  diff = juices[i] - distances[i]\n  if juice_consumed >= 0:\n   juice_consumed += diff\n  else:\n   juice_consumed = diff\n   start = i\n  total_juice_consumed += diff\n return start if total_juice_consumed >= 0 else -1\n\njuices = []\ndistances = []\nnumLines = int(input())\nfor each in range(0,numLines):\n line = input()\n result = [int(x) for x in re.findall('\\d+',line)]\n if result != []:\n  juices.append(result[0])\n  distances.append(result[1])\n\nprint(isCirlePossible(juices,distances))\nreturn"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: