【CodeForces - 202A】【LLPS】

题目：

This problem's actual name, "Lexicographically Largest Palindromic Subsequence" is too long to fit into the page headline.

You are given string s consisting of lowercase English letters only. Find its lexicographically largest palindromic subsequence.

We'll call a non-empty string s[p1p2... pk] = sp1sp2... spk (1  ≤  p1 < p2 < ... < pk  ≤ |s|) a subsequence of string s = s1s2... s|s|, where |s| is the length of string s. For example, strings "abcb", "b" and "abacaba" are subsequences of string "abacaba".

String x = x1x2... x|x| is lexicographically larger than string y = y1y2... y|y| if either |x| > |y| and x1 = y1, x2 = y2, ..., x|y| = y|y|, or there exists such number r (r < |x|, r < |y|) that x1 = y1, x2 = y2, ..., xr = yr and xr  +  1 > yr  +  1. Characters in the strings are compared according to their ASCII codes. For example, string "ranger" is lexicographically larger than string "racecar" and string "poster" is lexicographically larger than string "post".

String s = s1s2... s|s| is a palindrome if it matches string rev(s) = s|s|s|s| - 1... s1. In other words, a string is a palindrome if it reads the same way from left to right and from right to left. For example, palindromic strings are "racecar", "refer" and "z".

Input

The only input line contains a non-empty string s consisting of lowercase English letters only. Its length does not exceed 10.

Output

Print the lexicographically largest palindromic subsequence of string s.

Examples

Input

radar

Output

rr

Input

bowwowwow

Output

wwwww

Input

codeforces

Output

s

Input

mississipp

Output

ssss

Note

Among all distinct subsequences of string "radar" the following ones are palindromes: "a", "d", "r", "aa", "rr", "ada", "rar", "rdr", "raar" and "radar". The lexicographically largest of them is "rr".

解题报告：最近不知道为啥 英文题根本进不去，看不懂啊，貌似进入坑了，跳不出去了。。。这道题目是求解最大的字典序的回文子序列，根据样例的输入输出，可以找到规律，它将最大的所有字母都输出了。所以只需要根据这点就可以用sort 将它排序，然后倒数寻找就好。

ac代码：

#include<iostream>
#include<cstring>
#include<algorithm> 
using namespace std;

int main()
{
	char s[18];
	scanf("%s",s);
	int len=strlen(s);
	sort(s, s+len);
	int i=len-1;
	cout<<s[i];
	while(--i >=0 && s[i]==s[len-1])//--i这里写错了，写成了i--结果就是wa在39样例上，很难受
		cout<<s[len-1];
	cout<<endl;
}