Some people will make friend requests. The list of their ages is given and ages[i] is the age of the ith person. 
Person A will NOT friend request person B (B != A) if any of the following conditions are true:

age[B] <= 0.5 * age[A] + 7
age[B] > age[A]
age[B] > 100 && age[A] < 100

Otherwise, A will friend request B.
Note that if A requests B, B does not necessarily request A.  Also, people will not friend request themselves.
How many total friend requests are made?
Example 1:
Input: [16,16]
Output: 2
Explanation: 2 people friend request each other.

Example 2:
Input: [16,17,18]
Output: 2
Explanation: Friend requests are made 17 -> 16, 18 -> 17.
Example 3:
Input: [20,30,100,110,120]
Output: 3
Explanation: Friend requests are made 110 -> 100, 120 -> 110, 120 -> 100.

 
Notes:

1 <= ages.length <= 20000.
1 <= ages[i] <= 120.

```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

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "# id(index) -> age\n# age1 <= 7 + 0.5 age2\n# age1 > age2\n#age1 > 100 and age b < 100\n# no selfloop,\n#A request does not mean B reqeust A\n\ndef count_smaller_than(ages, target): # 1,15,17\n    left = 0 # 1\n    right = len(ages) - 1 # 0\n    \n    # 1 5 6 11 all elements smaller than  target 7\n    # 1  [5] [6  [11] L = 3 R= 3 --> L = 3 R = 2 L -1\n    #           L = 4 R = 3\n  # [5] [6] 11 12 0 -> 0 0 -> -1\n    # 5 6 | [6] 6 7 \n    while left <= right:\n        mid = left+(right-left)//2 # 15 # 1\n        if ages[mid] < target: # 15 < 15\n            left = mid+1        \n        # elif ages[mid] == target and ages[a_index] == ages[mid]:\n        #     right = mid - 1\n        else:# ages[mid] >= target:\n            right = mid -1 # 0 \n            \n    return left # 0 - 1\n            \n    # edge case [16,16]\n    \n    \n\nimport math\nclass Solution:\n    def numFriendRequests(self, ages: List[int]) -> int:\n        #brute force\n        #we loop on friends A\n            # we loop again B\n                # increment if a request B or B requests A\n                \n                # time o(n^2), space o(1)\n                \n        #A < B\n        # --> check only once not twice because second one is always false\n        #whenever B > 100 and A < 100 --> recursve\n        # O(N^2)\n        \n        #A --> 10 ---> [maximum length we make friends of] --> we search for that in the array and then we return\n        # nlogn --> sort\n        # n * logn (Binary search) to get the count\n        \n        ages.sort() # sort in ascending order\n        friend_requests = 0\n        \n        #[1,17,18]\n        for i in range(len(ages)):\n            age_a = ages[i]  # 16\n            \n            # max_age_b = max(age_a,) # age_a = 9 -> 4.5 + 7 -> 11.5\n            # 0 \n            \n            # 0 1 2 3 \n            # 1 * 0.5 + 7 -> 7\n            smaller_than = count_smaller_than(ages, math.floor(0.5 * age_a) + 8) # these are the ones to exclude, if it's\n            smaller_than_i = count_smaller_than(ages, age_a+1)\n            \n            a_requests = max(0, smaller_than_i - 1 - smaller_than)  #(itself)\n            \n            friend_requests += a_requests\n            \n        return friend_requests\n            \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'numFriendRequests'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5722