You are given two $0$ indexed integer arrays nums1 and nums2 of length n.

A range $[l, r]$ with $0 \leq l \leq r < n$ is considered balanced if, for every index $i$ in the range, you choose exactly one element from either nums1[i] or nums2[i] such that the sum of the elements chosen from nums1 is equal to the sum of the elements chosen from nums2.

Return the total number of balanced ranges. Two ranges are considered different if their boundary indices $[l, r]$ differ or if a different choice is made at any index within the range. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $1 \leq$ n $\leq 100$

• $0 \leq$ nums1[i], nums2[i] $\leq 100$

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.