/*
#include <stdio.h>
int solution(const char* s) {
int i, a=0, b=0, answer=0;
for(i=0;s[i]!=0;i++) {
a++;
if(a%2==0) {
a-i=b;
if(s[i]==s[b])
}
}
printf("%d", a);
return answer;
}
*/
/*
#include <stdio.h>
#include <malloc.h>
int* solution(int n) {
// return 값은 malloc 등 동적 할당을 사용해주세요. 할당 길이는 상황에 맞게 변경해주세요.
int* answer = (int*)calloc(n * (n+1) / 2, sizeof(int));
//int** arr=(int**)malloc(sizeof(int*)*n*(n+1)/2);
int i, j, a=1, arr[1001][1001];
for(i=1;i<=n;i++) {
for(j=1;j<=i;j++) {
arr[i][j]=a++;
}
}
for(i=1;i<=n;i++) {
for(j=1;j<=i;j++) {
printf("%d ", arr[i][j]);
}
printf("\n");
}
return answer;
}
*/
/*
#include <stdio.h>
#include <string.h>
int max(int a, int b)
{
if(a>b) return a;
else return b;
}
int palindrome(const char* s, int left, int right)
{
int answer=0, len;
len=strlen(s);
if(right-left==1) answer=0;
else answer=1;
while(left>=0&&right<len) {
if(s[left]==s[right]) {
left--;
right++;
answer+=2;
}
else break;
}
return answer;
}
int solution(const char* s) {
int i, j, a=0, b=0, answer=1, len;
len=strlen(s);
for(i=0;i<len;i++) {
//if(len==1) answer=1;
//else answer=max(palindrome(s, i, i+1), palindrome(s, i, i+2));
answer=palindrome(s, i, i+1);
//answer=palindrome(s, i, i+2);
}
return answer;
}
*/