Albert wants to know all of the strings that are $9$ characters long, contain only $X$s and $Y$s, and satisfy the property that there exists a way to swap two characters to get a palindrome. How many such strings are there?