Easy one PYTHON3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def sumOfSquares(self, nums: List[int]) -> int:\n\n        n=len(nums)\n        new=[]\n\n        for i in range(1,n+1):\n            if n%i == 0:\n                new.append(nums[i-1]**2)\n\n        return sum(new)\n        \n```
['Python3']