Difficulty Level: MEDIUM
Given a sequence of n strings, the task is to check if any two similar words come together and then destroy each other then, print the number of words left in the sequence after this pairwise destruction.
Hello ScholarHat ScholarHat Students!
(As ScholarHat and ScholarHat destroy each other. So, Hello Students! Will be the new String).