class Solution {
public:
    bool Palindrome(string str) {
        for (int i = 0, j = str.size() - 1; i < j; i++, j--)
            if (str[i] != str[j]) return false;
        return true;
    }
    string firstPalindrome(vector<string>& words) {
        int len = words.size();
        for (int i = 0; i < len; i++) 
            if (Palindrome(words[i]))
                return words[i];
        string ret;
        return ret;
    }
};