# include <stdio.h>
 
int isPalindrome(char s[]) {
    int i = 0;
    int j;
 
    // 文字列の長さを計算
    while (s[i] != '\0') {
        i++;
    }
    j = i - 1; // 最後の文字のインデックスにする
 
    // 文字列の先頭と末尾から比較していく
    for (i = 0; i < j; i++, j--) {
        if (s[i] != s[j]) {
            return 0; // 一箇所でも違っていれば回文ではない
        }
    }
 
    return 1; // すべて一致していれば回文
}
 
 
//メイン関数は書き換えなくてよいです
int main(){
    char s[100];
    scanf("%s",s);
    printf("%s -> %d\n",s,isPalindrome(s));
    return 0;
}
 

IyBpbmNsdWRlIDxzdGRpby5oPgoKaW50IGlzUGFsaW5kcm9tZShjaGFyIHNbXSkgewogICAgaW50IGkgPSAwOwogICAgaW50IGo7CgogICAgLy8g5paH5a2X5YiX44Gu6ZW344GV44KS6KiI566XCiAgICB3aGlsZSAoc1tpXSAhPSAnXDAnKSB7CiAgICAgICAgaSsrOwogICAgfQogICAgaiA9IGkgLSAxOyAvLyDmnIDlvozjga7mloflrZfjga7jgqTjg7Pjg4fjg4Pjgq/jgrnjgavjgZnjgosKCiAgICAvLyDmloflrZfliJfjga7lhYjpoK3jgajmnKvlsL7jgYvjgonmr5TovIPjgZfjgabjgYTjgY8KICAgIGZvciAoaSA9IDA7IGkgPCBqOyBpKyssIGotLSkgewogICAgICAgIGlmIChzW2ldICE9IHNbal0pIHsKICAgICAgICAgICAgcmV0dXJuIDA7IC8vIOS4gOeuh+aJgOOBp+OCgumBleOBo+OBpuOBhOOCjOOBsOWbnuaWh+OBp+OBr+OBquOBhAogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gMTsgLy8g44GZ44G544Gm5LiA6Ie044GX44Gm44GE44KM44Gw5Zue5paHCn0KCgovL+ODoeOCpOODs+mWouaVsOOBr+abuOOBjeaPm+OBiOOBquOBj+OBpuOCiOOBhOOBp+OBmQppbnQgbWFpbigpewogICAgY2hhciBzWzEwMF07CiAgICBzY2FuZigiJXMiLHMpOwogICAgcHJpbnRmKCIlcyAtPiAlZFxuIixzLGlzUGFsaW5kcm9tZShzKSk7CiAgICByZXR1cm4gMDsKfQo=

Z2lyYWZhcmln

girafarig