# include <stdio.h>
 
int isPalindrome(char s[]){
	int right=0;
	int left=0;
 
	 // まず文字列の長さを調べる
    while(s[right] != '\0'){
        right++;
    }
    right--;  // 最後の文字の位置へ
 
    // 左右から比較
    while(left < right){
        if(s[left] != s[right]){
            return 0;   // 回文ではない
        }
        left++;
        right--;
    }
 
    return 1;   // 回文
 
 
 
 
	//関数の中だけを書き換えてください
	//回文になっているとき１を返す
	//回文になっていないとき０を返す
}
 
//メイン関数は書き換えなくてよいです
int main(){
    char s[100];
    scanf("%s",s);
    printf("%s -> %d\n",s,isPalindrome(s));
    return 0;
}
 

IyBpbmNsdWRlIDxzdGRpby5oPgoKaW50IGlzUGFsaW5kcm9tZShjaGFyIHNbXSl7CglpbnQgcmlnaHQ9MDsKCWludCBsZWZ0PTA7CgkKCSAvLyDjgb7jgZrmloflrZfliJfjga7plbfjgZXjgpLoqr/jgbnjgosKICAgIHdoaWxlKHNbcmlnaHRdICE9ICdcMCcpewogICAgICAgIHJpZ2h0Kys7CiAgICB9CiAgICByaWdodC0tOyAgLy8g5pyA5b6M44Gu5paH5a2X44Gu5L2N572u44G4CgogICAgLy8g5bem5Y+z44GL44KJ5q+U6LyDCiAgICB3aGlsZShsZWZ0IDwgcmlnaHQpewogICAgICAgIGlmKHNbbGVmdF0gIT0gc1tyaWdodF0pewogICAgICAgICAgICByZXR1cm4gMDsgICAvLyDlm57mlofjgafjga/jgarjgYQKICAgICAgICB9CiAgICAgICAgbGVmdCsrOwogICAgICAgIHJpZ2h0LS07CiAgICB9CgogICAgcmV0dXJuIDE7ICAgLy8g5Zue5paHCgoJCgkKCQoJLy/plqLmlbDjga7kuK3jgaDjgZHjgpLmm7jjgY3mj5vjgYjjgabjgY/jgaDjgZXjgYQKCS8v5Zue5paH44Gr44Gq44Gj44Gm44GE44KL44Go44GN77yR44KS6L+U44GZCgkvL+WbnuaWh+OBq+OBquOBo+OBpuOBhOOBquOBhOOBqOOBje+8kOOCkui/lOOBmQp9CgovL+ODoeOCpOODs+mWouaVsOOBr+abuOOBjeaPm+OBiOOBquOBj+OBpuOCiOOBhOOBp+OBmQppbnQgbWFpbigpewogICAgY2hhciBzWzEwMF07CiAgICBzY2FuZigiJXMiLHMpOwogICAgcHJpbnRmKCIlcyAtPiAlZFxuIixzLGlzUGFsaW5kcm9tZShzKSk7CiAgICByZXR1cm4gMDsKfQo=

Z2lyYWZhcmln

girafarig