class Solution:
def minimumOperations(self, nums: List[int]) -> int:
l = len(nums)
seen = set()
for n in reversed(nums):
if n in seen:
break
seen.add(n)
l -= 1
return (l // 3) + int(bool(l%3))