# include <stdio.h>
 
int isPalindrome(char s[]){
	int len = 0;
	while(s[len]!='\0')len++;  //文字列の長さを数える
	for(int i=0; i<len/2; i++){
		if(s[i]!=s[len-1-i]){  //len-1-i 長さ-1だから一番右端はlen-1
			return 0;
		}	
	}
	return 1;
	//関数の中だけを書き換えてください
	//回文になっているとき１を返す
	//回文になっていないとき０を返す
}
 
//メイン関数は書き換えなくてよいです
int main(){
    char s[100];
    scanf("%s",s);
    printf("%s -> %d\n",s,isPalindrome(s));
    return 0;
}
 

IyBpbmNsdWRlIDxzdGRpby5oPgoKaW50IGlzUGFsaW5kcm9tZShjaGFyIHNbXSl7CglpbnQgbGVuID0gMDsKCXdoaWxlKHNbbGVuXSE9J1wwJylsZW4rKzsgIC8v5paH5a2X5YiX44Gu6ZW344GV44KS5pWw44GI44KLCglmb3IoaW50IGk9MDsgaTxsZW4vMjsgaSsrKXsKCQlpZihzW2ldIT1zW2xlbi0xLWldKXsgIC8vbGVuLTEtaSDplbfjgZUtMeOBoOOBi+OCieS4gOeVquWPs+err+OBr2xlbi0xCgkJCXJldHVybiAwOwoJCX0JCgl9CglyZXR1cm4gMTsKCS8v6Zai5pWw44Gu5Lit44Gg44GR44KS5pu444GN5o+b44GI44Gm44GP44Gg44GV44GECgkvL+WbnuaWh+OBq+OBquOBo+OBpuOBhOOCi+OBqOOBje+8keOCkui/lOOBmQoJLy/lm57mlofjgavjgarjgaPjgabjgYTjgarjgYTjgajjgY3vvJDjgpLov5TjgZkKfQoKLy/jg6HjgqTjg7PplqLmlbDjga/mm7jjgY3mj5vjgYjjgarjgY/jgabjgojjgYTjgafjgZkKaW50IG1haW4oKXsKICAgIGNoYXIgc1sxMDBdOwogICAgc2NhbmYoIiVzIixzKTsKICAgIHByaW50ZigiJXMgLT4gJWRcbiIscyxpc1BhbGluZHJvbWUocykpOwogICAgcmV0dXJuIDA7Cn0K

Z2lyYWZhcmln

girafarig