#include <stdio.h>//第二回課題２
#include <stdlib.h>
 
int myStrlen(char s[]){
    int i;
    for(i=0;s[i]!='\0';i++);
    return i;
}
 
// 関数の中でtmpに対してmallocして
// そこに回文を代入してreturnで返しましょう
char *setPalindrome(char s[]){
	char *tmp;
	int i,n;
	i=myStrlen(s);
	tmp=(char*)malloc(sizeof(char)*i);
	for(n=0;n<i;n++)
	tmp[n]=s[n];
 
	for(n=0;n<i;n++)
	tmp[i+n]=s[i-1-n];
 
	return tmp;
 
}
 
 
//メイン関数はいじる必要はありません
int main(){
    char nyuryoku[1024]; //入力
    char *kaibun;   //回文を受け取る
    scanf("%s",nyuryoku);
    kaibun = setPalindrome(nyuryoku);
    printf("%s\n  -> %s\n",nyuryoku,kaibun);
    free(kaibun);
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+Ly/nrKzkuozlm57oqrLpoYzvvJIKI2luY2x1ZGUgPHN0ZGxpYi5oPgoKaW50IG15U3RybGVuKGNoYXIgc1tdKXsKICAgIGludCBpOwogICAgZm9yKGk9MDtzW2ldIT0nXDAnO2krKyk7CiAgICByZXR1cm4gaTsKfQoKLy8g6Zai5pWw44Gu5Lit44GndG1w44Gr5a++44GX44GmbWFsbG9j44GX44GmCi8vIOOBneOBk+OBq+WbnuaWh+OCkuS7o+WFpeOBl+OBpnJldHVybuOBp+i/lOOBl+OBvuOBl+OCh+OBhgpjaGFyICpzZXRQYWxpbmRyb21lKGNoYXIgc1tdKXsKCWNoYXIgKnRtcDsKCWludCBpLG47CglpPW15U3RybGVuKHMpOwoJdG1wPShjaGFyKiltYWxsb2Moc2l6ZW9mKGNoYXIpKmkpOwoJZm9yKG49MDtuPGk7bisrKQoJdG1wW25dPXNbbl07CgkKCWZvcihuPTA7bjxpO24rKykKCXRtcFtpK25dPXNbaS0xLW5dOwoJCglyZXR1cm4gdG1wOwoKfQoKCi8v44Oh44Kk44Oz6Zai5pWw44Gv44GE44GY44KL5b+F6KaB44Gv44GC44KK44G+44Gb44KTCmludCBtYWluKCl7CiAgICBjaGFyIG55dXJ5b2t1WzEwMjRdOyAvL+WFpeWKmwogICAgY2hhciAqa2FpYnVuOyAgIC8v5Zue5paH44KS5Y+X44GR5Y+W44KLCiAgICBzY2FuZigiJXMiLG55dXJ5b2t1KTsKICAgIGthaWJ1biA9IHNldFBhbGluZHJvbWUobnl1cnlva3UpOwogICAgcHJpbnRmKCIlc1xuICAtPiAlc1xuIixueXVyeW9rdSxrYWlidW4pOwogICAgZnJlZShrYWlidW4pOwogICAgcmV0dXJuIDA7Cn0=

YWJjZA==

abcd