Maximum Palindromes After Cross-String Swaps

Requirements Input consists of an integer n and a lowercase string array arr containing exactly n elements. You may repeat the following action as often as needed: select two distinct strings, then exchange one character from each of them. Return the largest count of strings that can be made palindromes after these operations. Individual string sizes cannot change, while repeated exchanges allow characters to be distributed across the full collection. Examples