There are n people on a social media platform, with the age of each person given in an integer array ages, where ages[i] represents the age of the $i^{th}$ person.

A person x will not send a friend request to a person y if any of the following conditions hold true:

• ages[y] $\leq 0.5 \times$ ages[x] $+ 7$

• ages[y] $>$ ages[x]

• ages[y] $> 100$ and ages[x] $< 100$

Otherwise, x will send a friend request to y.

Return the total number of friend requests sent across all people.

Note: If x sends a friend request to y, y does not necessarily send a friend request to x. Additionally, no person can send a friend request to themselves.

Constraints:

• n $==$ ages.length

• $1 \le$ n $\leq 2 \times 10^4$

• $1 \le$ ages[i] $\le 120$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.