**Approach1:**

*Simple algorithm*

- n := row count of matrix
- if n <= 2, then
- return sum of all elements in matrix
- first_row := sum of first row
- last_row := sum of last row
- diagonal = sum of matrix[i, n-1-i] for all i from 1 to n-2
- return first_row + last_row…

Given two integers `x`

, and `y`

return the number of positions where their values differ in their binary representations as a 32-bit integer.

# Example 1

**Input**

`x = 9`

y = 5

**…**