You are given a $1$-indexed integer array nums of length n.

An element nums[i] is considered special if i divides n evenly, meaning n % i == 0.

Return the sum of the squares of all special elements in nums.

Constraints:

• $1 \leq$ nums.length $=$ n $\leq 50$

• $1 \leq$ nums[i] $\leq 50$

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.