Background

Description

Given a string, compute recursively (no loops) a new string where all the lowercase 'x' chars have been changed to 'y' chars.

Format

Input

Output

Samples

codex

"codey"

xxhixx

"yyhiyy"

xhixhix

"yhiyhiy"

Limitation

1s, 1024KiB for each test case.