<s>[INST] Given a n x n matrix, find all elements that appear more than n/2 times.

Example:
Input: 
[[1,2,1],[2,1,1]]

Output:
[1]

Explanation:
The element 1 appears twice in the first row and twice in the second row so it appears 4 times so it should be included.
The element 2 appears once in the first row and once in the second row so it appears 2 times so it shouldn't be included.


The idea to solve this problem is to use Boyer-Moore Majority Vote algorithm. 
Can you implement it in python?[/INST]