An IPv$4$ address is a $32$ bit number written in the form "a.b.c.d", where a, b, c, and d are integers in the range $[0, 255]$ representing four $8$ bit groups.

A CIDR block is written in the form "a.b.c.d/len", where "a.b.c.d" is the starting IP address and len is an integer representing the prefix length in bits. A CIDR block with length len covers $2^{32 - ext{len}}$ consecutive IP addresses that share the same first len bits.

Given a starting IPv$4$ address ip and an integer n, return a list of CIDR blocks that covers the range of n consecutive IP addresses starting at ip. The resulting list must cover every IP address in the range exactly once, contain no IP addresses outside the range, and use the minimum possible number of CIDR blocks.

Constraints:

• $7 \leq$ ip.length $\leq 15$

• ip is a valid IPv$4$ address in the form "a.b.c.d" where a, b, c, and d are integers in the range $[0, 255]$.

• $1 \leq$ n $\leq 1000$

• Every implied address ip + x (for $x < n$) will be a valid IPv$4$ address.

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.