package main import ( "bufio" "fmt" "math" "os" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var rdr = bufio.NewReaderSize(os.Stdin, 1000000) func main() { sc.Split(bufio.ScanWords) ret := make([][2]int, 0, 100) w := 'w' s := []rune(nextLine()) if s[0] == w { s = s[1:] } count := 0 prev := false for i, r := range s { if r == w && prev { count++ continue } if r != w && prev { ret = append(ret, [2]int{count, i - count - 1}) prev = false continue } if r == w && !prev { count = 1 prev = true continue } } if prev { ret = append(ret, [2]int{count, len(s) - count - 1}) } max := ret[0][0] for _, v := range ret { if v[0] > max { max = v[0] } } for _, v := range ret { if max != v[0] { continue } for i := v[1]; i >= 0; i-- { if s[i] == w { fmt.Println(string(s[i+1 : v[1]+1])) break } if i == 0 { fmt.Println(string(s[i : v[1]+1])) break } } } } func nextLine() string { sc.Scan() return sc.Text() } func nextInt() int { i, _ := strconv.Atoi(nextLine()) return i } func nextInt64() int64 { i, _ := strconv.ParseInt(nextLine(), 10, 64) return i } func nextUint64() uint64 { i, _ := strconv.ParseUint(nextLine(), 10, 64) return i } func nextFloat() float64 { f, _ := strconv.ParseFloat(nextLine(), 64) return f } func readLine() string { buf := make([]byte, 0, 1000000) for { l, p, e := rdr.ReadLine() if e != nil { panic(e) } buf = append(buf, l...) if !p { break } } return string(buf) } func factor(n uint64) []uint64 { if n <= 1 { return []uint64{n} } ps := make([]uint64, 0, 100) for i := uint64(2); i*i <= n; i++ { for n%i == 0 { n /= i ps = append(ps, i) } } if n > 1 { ps = append(ps, n) } return ps } func gcd(a, b uint64) uint64 { for ; b != 0; b, a = a%b, b { } return a } func exGcd(x, y int64) (a, b, c int64) { if x <= 0 || y <= 0 { return } r0, r1 := x, y a0, a1 := int64(1), int64(0) b0, b1 := int64(0), int64(1) for r1 > 0 { q1, r2 := r0/r1, r0%r1 a2, b2 := a0-q1*a1, b0-q1*b1 r0, r1 = r1, r2 a0, a1 = a1, a2 b0, b1 = b1, b2 } a, b, c = a0, b0, r0 return } func chinese(a1, m1, a2, m2 int64) int64 { a, _, c := exGcd(m1, m2) if c != 1 { return -1 } x := a1 + (a2-a1)*a*m1 for x < 0 { x += m1 * m2 } return x } func lcm(a, b uint64) uint64 { return (a * b) / gcd(a, b) } func round(f float64, place int) float64 { shift := math.Pow10(place) return math.Floor(f*shift+.5) / shift } func round1(f float64) float64 { return math.Floor(f + .5) } func bitCount(n int64) int64 { c := int64(0) for i := uint(0); i < 64; i++ { if n>>i&1 == 1 { c++ } } return c }