Python3 easy Solution
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$$0(n)$$\n\n# Code\n```\nclass Solution:\n    def sumOfSquares(self, nums: List[int]) -> int:\n        #count of the sum of squares\n        count=0\n        #length of nums\n        n=len(nums) \n        for i in range(0,n) :\n            if  n%(i+1)==0:\n                count+=nums[i]**2\n        return count\n```
['Python3']