#include <stdlib.h>
int longestPalindrome(char *s)
{
int ret = 0;
int lenstr = strlen(s);
int num[26] = { 0 };
int flag = 0;
for (int i = 0;i < lenstr;i++)
{
int j = s[i] - 97;
num[j] = num[j] + 1;
}
for (int k = 0;k < 25;k++)
{
if (num[k] % 2 == 0)
{
ret = ret + num[k];
}
else
{
if (num[k] >= 2)
{
ret = ret + num[k] - 1;
flag = 1;
}
else if (num[k] == 1)
{
flag = 1;
}
}
}
if (flag == 1)
{
ret++;
}
return ret;
}
int main(void)
{
char* str = "abccccdd";
printf("%d\n", longestPalindrome(str));
return 0;
}