input: from collections import Counter
  
  def min_anagram_length(s: str) -> int:
      """
      You are given a string s, which is known to be a concatenation of anagrams of some string t.
  
      Return the minimum possible length of the string t.
  
      An anagram is formed by rearranging the letters of a string. For example, "aab", "aba", and, "baa" are anagrams of "aab".
  
  
      Examples:
      >>> s = "abba"
      2
      >>> s = "cdef"
      4
  
      Constraints:
      1 <= s.length <= 10^5
      s consist only of lowercase English letters.
      """
  
output: 
      counter = Counter(s)
      min_length = 0
      for count in counter.values():
          min_length += count // 2 + count % 2
      return min_length
  