Problem:
 Score : 200 points    Problem Statement  Given is a string S . Replace every character in S with x and print the result.      Constraints   S is a string consisting of lowercase English letters.  The length of S is between 1 and 100 (inclusive).         Input  Input is given from Standard Input in the following format:  S       Output  Replace every character in S with x and print the result.        Sample Input 1 sardine      Sample Output 1 xxxxxxx  Replacing every character in S with x results in xxxxxxx .       Sample Input 2 xxxx      Sample Output 2 xxxx       Sample Input 3 gone      Sample Output 3 xxxx

Solution (Python):

S = str(input())
print("x" * len(S))

Solution (Python):
S = input()

S_len = len(S)

ans = 'x'

for _ in range(S_len - 1):
    ans = ans + 'x'

print(ans)

Solution (Python):
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]


def fetch_ints_inputs(times):
    return [fetch_int_input() for _ in range(times)]


string = fetch_one_line()

print(("").join(["x" for _ in string]))

Solution (Python):
s = input()
 
print('x' * len(s))

Solution (Python):

S = input()

print("x" * len(S))

Solution (Python):
s= input()

ans="x"

ans *= len(s)
print(ans)

Solution (Python):
import re
print(re.sub('[a-z]', 'x', input()))

Solution (Python):
U = input()

print("x" * len(U))

Solution (Python):
s=input()
l=len(s)
print("x"*l)

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
s = input()
anc = ''
for i in range(len(s)):
    anc += 'x'
print(anc)

Solution (Python):
s=input()
print(len(s)*'x')

Solution (Python):
s = input()
print("x" * len(s))

Solution (Python):
S = input()
S1 = len(S)

print("x" * S1)

Solution (Python):
S = input()
x = ''
for i in range(len(S)):
    x +='x'
print(x)

Solution (Python):
S = input()
a = [str(c) for c in S]

for i in range(len(a)):
    a[i] = "x"

ans = ''.join(a)
print(ans)

Solution (Python):








import collections

S = input()

ans = 'x' * len(S)

print(ans)

Solution (Python):
A = input()

print('x'*len(A))

Solution (Python):
S=len(input())
print("x"*S)

Solution (Python):
S = input()
l = len(S)
ans = "x"*l
print(ans)

Solution (Python):

s = len(input())


for i in range(s):
  print("x",end="")

Solution (Python):
S = input()
cS = len(S)
print("x"*cS)

Solution (Python):

import sys


def solve(S: str):
    print("".join(["x"*len(S)]))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
x = "x"
a = (x * len(s))
print(a)

Solution (Python):
s=input()
li=[]
for i in range(len(s)):
  li.append("x")
for i in range(len(li)):
  print(li[i], end="")

Solution (Python):
S = input()

print("x"*len(S))

Solution (Python):

moji = ""
for x in input():
    moji += "x"

print(moji)

Solution (Python):
def func():
    return


s = input()




ans = ''
for id in s:
    ans += 'x'

print(ans)

Solution (Python):
s = input()

x = ''
for _ in range(len(s)):
  x += 'x'
print(x)

Solution (Python):
s = input()

for i in range(len(s)):
  print('x',end="")

print()

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
s = input()
for i in range(len(s)):
  print('x',end="")

Solution (Python):
s = input()
o = 'x' * len(s)
print(o)

Solution (Python):
S = input()
l = len(S)
print('x'*l)

Solution (Python):


def main():
    s = input()
    tmp = ['x']*len(s)
    ans = ''.join(tmp)
    print(ans)
main()

Solution (Python):
S = input()

print("".join(["x" for _ in range(len(S))]))

Solution (Python):
S = input().split()[0]

l = list(S)
s=""
for i in l:
  s+="x"
print(s)

Solution (Python):
s = input()
sl = len(s)
r = 'x'*sl
print(r)

Solution (Python):
S = list(input())

for i in range(len(S)):
    S[i] = 'x'

print(''.join(S))

Solution (Python):

s = str(input())
res = ""

for i in range(len(s)):
    res += "x"

print(res)

Solution (Python):
s = input()

l = ['x' for i in range(len(s))]
print(''.join(l))

Solution (Python):
def main():
    hoge = input()
    print("x" * len(hoge))

if __name__ == '__main__':
    main()

Solution (Python):

S = input()
answer = ""
for s in S:
    answer += "x"
print(answer)

Solution (Python):
s = list(input())
ans = ""
for i in range(len(s)):
    ans += "x"
print(ans)

Solution (Python):
s=input()
for i in range(len(s)):
    print("x", end="")

Solution (Python):
num = input()
ad = ""
for i in num:
  ad+="x"
print(ad)

Solution (Python):
s=input()
print('x'*len(s))

Solution (Python):
s = input()
l = len(s)

print("x"*l)

Solution (Python):
s=len(input())
print('x'*s)

Solution (Python):
a=input()
import re
result=re.sub(r'[a-z]', "x", a)
print(result)

Solution (Python):
for i in range(len(input())):
    print("x", end="")
print()

Solution (Python):
s = str(input())
s_len = len(s)
X = "x"
for i in range(s_len-1):
    X = X + "x"
    
print(X)

Solution (Python):
print('x'*len(input()))

Solution (Python):


def main():
    S = input()
    print("x" * len(S))


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
ans = ['x']*len(S)
print(''.join(ans))

Solution (Python):
s=input()
ans="x"*len(s)
print(ans)

Solution (Python):
s = input()
num = len(s)

print('x'*num)

Solution (Python):
a = input()
print('x'*len(a))

Solution (Python):
s = input()

ans = ''
for i in range(len(s)):
    ans += 'x'
print(ans)

Solution (Python):
s=input()
a=len(s)
print("x"*a)

Solution (Python):
length = len(input())
print(''.join(['x' for i in range(length)]))

Solution (Python):
s=input()
t=''
for i in range(len(s)):
  t+='x'
print(t)

Solution (Python):
s = input()

ans = "x" * len(s)
print(ans)

Solution (Python):
s = str(input())
ans = "x"*len(s)
print(ans)

Solution (Python):
S = str(input())

T = "x"
for i in range(1,len(S)):
    T += "x"

print(T)

Solution (Python):
s = input()
x = ["x"] * len(s)
x = "".join(x)
print(x)

Solution (Python):
s = input()
ans = ""

for i in s:
  ans += "x"
  
print(ans)

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):

def solve():
    S = raw_input()
    lS = len(S)
    XS = ['x'] * lS
    strXS = ''.join(XS)
    print strXS

if __name__ == '__main__':
    solve()

Solution (Python):
s = str(input())
print("x" * len(s))

Solution (Python):
s = input()
l = len(s)
print('x'*l)

Solution (Python):
def main():
    s = input()
    ans = ''
    for i in range(len(s)):
        ans += 'x'
    print(ans)


main()

Solution (Python):
s = input()
list = []
for i in range(len(s)):
  list.append('x')
print(''.join(list))

Solution (Python):
s=input()
print('x'*len(s))

Solution (Python):
S = input()

d = "x"
for i in range(0,len(S)-1):
    d = d + "x"
print(d)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





s=len(list(input()))

print("".join(["x"]*s))

Solution (Python):
S = input()
a = len(S)
print('x'*a)

Solution (Python):
S = input()
n = len(S)

ans = ""

for i in range(n):
  ans = ans + "x"
  
print(ans)

Solution (Python):
s = input()
print('x' * len(s))

Solution (Python):
print("x"*len(input()))

Solution (Python):
def main():
    S = input()

    for i, s in enumerate(S):
        print('x', end='')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

print("x" * len(S))

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):
x = input()

print('x'*len(x))

Solution (Python):
S = input()
T = list(S)
a = len(T)
A = ['x' for i in range(a)]
B = ''.join(A)
print(B)

Solution (Python):
s = input()
print("x" * len(s))

Solution (Python):
s=input()
print('x'*len(s))

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
import queue
import copy


def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z


def bfs(SS, x, y, H, W):
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" 
    for i in range(4): 
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      
      
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" 
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      
  return mlength


def prime_factorize(n):
  a = []
  while n % 2 == 0:
    a.append(2)
    n //= 2
  f = 3
  while f * f <= n:
    if n % f == 0:
      a.append(f)
      n //= f
    else:
      f += 2
  if n != 1:
    a.append(n)
  return a







S = str(input())

ans = "x"

for i in range(len(S)-1):
  ans += "x"

print(ans)

Solution (Python):
s_line = input()

for i in range(len(s_line)):
    print("x", end="")

Solution (Python):
a = input()

for i in range(len(a)):
  print("x",end="")

Solution (Python):
import sys
input = sys.stdin.readline

S = input()

for i in range(len(S) - 1):
    print("x", end="")

Solution (Python):
print('x' * len(input()))

Solution (Python):
S = input()

for i in S:
  print("x", end="")

Solution (Python):
S = input()
ST = "x"*len(S)
print(ST)

Solution (Python):
s = input()
n = len(s)
for i in range(n):
  print("x", end="")

Solution (Python):
s = raw_input()
print("x"*len(s))

Solution (Python):

import sys


def solve(S: str):
    ans = ['x' for s in S]
    print(''.join(ans))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
n = len(s)

print("x" * n)

Solution (Python):
def main():
	
	
	S = input()
	L = ['x'] * len(S)
	print(*L, sep='')

if __name__ == '__main__':
    main()

Solution (Python):
inp = input()
n = len(inp)
answer = 'x' * n
print(answer)

Solution (Python):
s = str(input())
a = ""
for u in range(len(s)):
  a += "x"
print(a)

Solution (Python):

s=input()
ans=""
for i in range(len(s)):
    ans+="x"
print(ans)

Solution (Python):
print('x'*len(input()))

Solution (Python):
u = str(input())
print("x" * len(u))

Solution (Python):
S=list(input())
print("x"*len(S))

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
s = input()
t = len(s)
ans = 'x' * t
print(ans)

Solution (Python):
a = len(input())
s='x'*a
print(s)

Solution (Python):
S=input()

print("x"*len(S))

Solution (Python):
s = input()
a = len(s)
print('x' * a)

Solution (Python):
S=input()
print("x"*len(S))

Solution (Python):
S = input()

print("x" * len(S))

Solution (Python):
s = input().rstrip()
s = list(s)
l = len(s)

for _ in range(l):
  print('x',end='')
print('')

Solution (Python):
s = str(input())

n = len(s)
t = ""
for i in range(n):
    t += "x"

print(t)

Solution (Python):
import sys


TEST_INPUT = [
    """
    sardine
    """,
    """
    xxxx
    """,
    """
    gone
    """
]
ANSWER = [
    "xxxxxxx",
    "xxxx",
    "xxxx"
]


class InputHandler:

    def __init__(self, text_lines="", is_test=False):
        self.data = list(text_lines.split("\n"))
        self.index = 0
        self.is_test = is_test

    def input(self):
        if self.is_test:
            self.index += 1
            return self.data[self.index].strip()
        else:
            return sys.stdin.readline().rstrip()


def solve(ih):
    s = ih.input()
    return "x" * len(s)


def main():
    ih = InputHandler()
    res = solve(ih)
    print(res)


def test():
    for test_input, ans in zip(TEST_INPUT, ANSWER):
        ih = InputHandler(test_input, True)
        res = solve(ih)
        assert str(res) == str(ans)


if __name__ == "__main__":
    test()
    main()

Solution (Python):
s = input()
s_num = len(list(s))
result = ""
for i in range(s_num):
  result += "x"
print(result)

Solution (Python):
S = input()
n = len(S)

c = ""
for i in range(n):
    c += "x"

print(c)

Solution (Python):
s = input()

print('x' * len(s))

Solution (Python):
S=str(input())
L=len(S)
x="x"
print(x*L)

Solution (Python):
S = input()
 
s = 'x' * len(S)

print(s)

Solution (Python):
s_l = len(input())
a = ''
for i in range(s_l):
    a += 'x'
print(a)

Solution (Python):
s = str(input())
print("x" * len(s))

Solution (Python):
s = str(input())
a = len(s)
for i in range(a):
  print("x", end="")

Solution (Python):

import sys


def solve(S: str):
    print("x" * len(S))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print("x"*len(s))

Solution (Python):
S = input()
n = len(S)
print('x' * n)

Solution (Python):
S=str(input())
S="x"*len(S)
print(S)

Solution (Python):


def main():
    s = input()
    out = ''

    for i in range(len(s)):
        out += 'x'
    
    print(out)

if __name__ == "__main__":
    main()

Solution (Python):
s = list(input())

for _ in s:
    print('x', end='')

Solution (Python):
S = input()
n = len(S)

print('x' * n)

Solution (Python):
S = input()
ans = 'x'
for _ in range(1,len(S)): ans += 'x'
print(str(ans))

Solution (Python):
S = input().strip() ; 
print ( "x" * len(S) ) ;

Solution (Python):
u=str(input())

print("x"*len(u))

Solution (Python):
n = len(input().strip())
print("x"*n)

Solution (Python):
S = input()

ans = []

for i in range(0, len(S)):
    ans.append('x')

print(''.join(ans))

Solution (Python):
S = input()
l = len(S)
print("x"*l)

Solution (Python):
print("x"*len(input()))

Solution (Python):
S=input()
length=len(S)

print("x"*length)

Solution (Python):
S = input()
res = ''

for chr in S:
  res += 'x'

print(res)

Solution (Python):
S=input()
for i in range(len(S)):
  print("x",end="")
print("")

Solution (Python):
s = input()
print("x" * len(s))

Solution (Python):
s=input()

print("x"*len(s))

Solution (Python):
S = input()
Answer = 'x'*len(S)

print(Answer)

Solution (Python):
s = input()
for _ in range(len(s)):
    print("x", end="")
print()

Solution (Python):
strS = input()

print('x'*len(strS))

Solution (Python):
S = input()
print("x" * len(S))

Solution (Python):
s = input()
print(len(s)*'x')

Solution (Python):
print("x" * len(input()))

Solution (Python):
s=str(input())
x=''
for i in range(len(s)):
    x+='x'
print(x)

Solution (Python):
s = input()
for _ in range(len(s)):
    print('x', end="")

Solution (Python):
moji=input()

for i in moji:
    print('x',end='')
print()

Solution (Python):
S=input()
l=len(S)
T=["x"]*l
print("".join(T))

Solution (Python):
s = input()

ans = ''.join(['x' for i in range(len(s))])

print(ans)

Solution (Python):


s=list(input())
x = "x"*len(s)
print(x)

Solution (Python):
a = input()

print("x" * len(a))

Solution (Python):
def solve():
    S = input()
    s = 'x' * len(S)
    print(s)

solve()

Solution (Python):
s=input()
n=len(s)
print('x'*n)

Solution (Python):
S = input()

ans = ""
for s in S:
    ans += "x"
print(ans)

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):
s = input()
n = len(s)
a = ["x" for i in range(n)]
moji = ''.join(a)
print(moji)

Solution (Python):
S = input()

print("x"*len(S))

Solution (Python):
S=input()

ans = 'x'*(len(S))
print(ans)

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''


def main():
    S = input()
    s = len(S)
    out = "x" * s
    print(out)


if __name__ == '__main__':
    main()

Solution (Python):
a=input()
b=''
for i in range(len(a)):
	b = b + 'x'
print(b)

Solution (Python):
from sys import stdin

if __name__ == '__main__':
    S = stdin.readline().rstrip()
    result = 'x' * len(S)
    print(result)

Solution (Python):
s = input()

sl = len(s)

print('x' * sl)

Solution (Python):
a = input()
b = len(a)

res = ""
for _ in range(b):
  res += "x"

print(res)

Solution (Python):
s = input()
ans = ''
for i in s:
  ans += 'x'
print(ans)

Solution (Python):
S = input()
res = ""
if len(S) > 0:
    for i in range(len(S)):
        res += "x"

print(res)

Solution (Python):
s = input()
ans = ""
for i in range(len(s)):
    ans = ans + "x"
print(ans)

Solution (Python):
s = input()

ans = ""
for i in range(len(s)):
  ans += 'x'
  
print(ans)

Solution (Python):
print("x"*len(input()))

Solution (Python):
s=str(input())
r=["x"]*len(s)
r=("".join(r))
print(r)

Solution (Python):
s=input()
ans=''
for i in range(len(s)):
    ans+='x'
print(ans)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S = list(input())
X = ["x" for i, s in enumerate(S)]
print("".join(X))

Solution (Python):
n = len(input())

print(n*'x')

Solution (Python):
S=input()
T=""

for i in range(len(S)):
  T += "x"
  
print(T)

Solution (Python):
s = input()
ans = 'x' * len(s)
print(ans)

Solution (Python):
l = (input())
s = ''
for i in range(len(l)):
    s+='x'
print(s)

Solution (Python):
print("{}".format("x"*len(input())))

Solution (Python):
s=input()

l=len(s)

ans="x"
for i in range(l-1):
    ans = ans +"x"
print(ans)

Solution (Python):
S = str(input())
T='x'*len(S)
print(T)

Solution (Python):
S=str(input())

x=''

for i in range(len(S)):
    x=x+'x'

print(x)

Solution (Python):
s = input()
result = ""
for i in s:
  result += "x"
print(result)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S = input()

print("x" * len(S))

Solution (Python):
S=input()

L=len(S)

print('x'*L)

Solution (Python):
s = input()

ans=""
for i in s:
  ans += "x"

print(ans)

Solution (Python):
if __name__ == '__main__':
    s = input()
    ans = ""
    for i in range(len(s)):
        ans = ans + "x"
    print(ans)

Solution (Python):
s = str(input())

l = len(s)
print('x' * l)

Solution (Python):
s=input()
l=len(s)
xx="x"*l
print(xx)

Solution (Python):
sn = len(input())
print("x"*sn)

Solution (Python):

S = str(input())
T = ''
for i in range(len(S)):
    T = T + 'x'
print(T)

Solution (Python):
s=input()
n=int(len(s))
for _ in range(n):
    print('x',end="")
print()

Solution (Python):
a = input()
d = len(a)
print("x"*d)

Solution (Python):
s = input()

print('x' * len(s))

Solution (Python):
print("x" * len(input()))

Solution (Python):
def main():
	
	
	u = str(input())
	
	
	print("x"*int(len(u)))
 
	
 
if __name__ == '__main__':
	main()

Solution (Python):
S = input()
b = []

for i in range(len(S)):
    b.append('x')

print(''.join(b))

Solution (Python):
S_lists = list(input())

for i in range(len(S_lists)):
    S_lists[i] = 'x'


print(''.join(S_lists))

Solution (Python):
s = input()
a = ""
for i in range(len(s)):
  a += "x"
print(a)

Solution (Python):
s = input()
a = ""
for i in range(len(s)):
    a += "x"
print(a)

Solution (Python):
a = len(input())

print("x"*a)

Solution (Python):
print('x' * len(input()))

Solution (Python):
s = input().rstrip()

print("x" * len(s))

Solution (Python):
def solve():
    S = input()
    s = len(S)
    l = ['x' for _ in range(s)]
    return ''.join(l)

print(solve())

Solution (Python):
s = input()
a = ""
for i in range(len(s)):
    a += "x"
print(a)

Solution (Python):
s=input()
for i in range(len(s)):
  print('x', end='')
print()

Solution (Python):
s = input()
a = ""
for i in range(len(s)):
  a+="x"
print(a)

Solution (Python):
S = input()
l = len(S)
print('x'*l)

Solution (Python):
a=input()

n= len(a)

print('x'*n)

Solution (Python):
S = input()

x = ""
for i in range(len(S)):
	x += "x"

print(x)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S=input()
X='x'

if len(S)==1:
    print(X)
else:
    for i in range(0,len(S)-1):
        X=X+'x'
    print(X)

Solution (Python):
s = input()
xs = ''
for i in range(len(s)):
  xs += 'x'
print(xs)

Solution (Python):
S = input()

s = ''.join('x' for _ in range(len(S)))
print(s)

Solution (Python):
s = input()
for i in range(len(s)):
  print('x', end = '')

Solution (Python):
l = len(input())
print('x'*l)

Solution (Python):
S = input()
tmp = len(S)

print('x' * tmp)

Solution (Python):


S=input()


print("x"*len(S))

Solution (Python):
print('x'*len(input()))

Solution (Python):
s = input()
c = ''
for i in range(len(s)):
  c += 'x'
  

print(c)

Solution (Python):
s= input()
print('x'*len(s))

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]



def A():
    s, t = input().split()
    a, b = LI()
    u = input()
    if u == s:
        print("{} {}".format(a - 1, b))
    elif u == t:
        print("{} {}".format(a, b - 1))
    return



def B():
    s = input()
    print('x' * len(s))
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



if __name__ == "__main__":
    B()

Solution (Python):
s = input()
ans = 'x'*len(s)
print(ans)

Solution (Python):
def main():
	s=input()
	print('x'*len(s))
main()

Solution (Python):
n=input()
j=len(n)
print("x"*j)

Solution (Python):
S=len(input())
print("x"*S)

Solution (Python):
a  = [s.split() for s in open(0)]
s = ""
for i in range(len(a[0][0])):
    s += "x"
print(s)

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
[print('x',end='') for i in range(len(input()))]

Solution (Python):
s = len(input())

for i in range(s):
    print("x",end="")

Solution (Python):
s = input()
ans = ''
for i in range(len(s)):
    ans+="x"
print(ans)

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

S = input()
a = len(S)
z = "x"*a
print(z)

Solution (Python):
'''
.append(要素) リストに要素を追加 
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
import itertools
from functools import reduce
from operator import mul

print('x'*len(stdin.readline().rstrip()))

Solution (Python):
a = input()
print("x"*len(a))

Solution (Python):
s = input()

for i in range(len(s)):
    print("x", end="")

Solution (Python):
str = input()
str_len = len(str)

result = ''
for i in range(str_len):
    result += 'x'

print(result)

Solution (Python):
c = input()
c_len = len(c)

ans = "x"*c_len
print(ans)

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
S = input()

ans = 'x' * len(S)

print(ans)

Solution (Python):
sLen = len(input())

print('x' * sLen)

Solution (Python):
import queue
import copy
import math
from collections import deque
import bisect


s = str(input())


ll = len(s)

a = ""
for i in range(0, ll):
    a += "x"

print(a)

Solution (Python):
print('x' * len(input()))

Solution (Python):
s = input()
ans = ''

for char in s:
    ans += 'x'

print(ans)

Solution (Python):
print('x'*len(input()))

Solution (Python):
S = input() 

result = ''

for i in range(len(S)):
    result = result + 'x'
    
print(result)

Solution (Python):
S = len(list(str(input())))

for i in range(S):
  print("x" ,end="")

Solution (Python):
print('x' * len(input()))

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
    *a,=map(int,open(0))
def S_():
    return input()
def IS():
    return input().split()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'

    mp=[1]*(w+2)
    found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['YES','NO']

mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()

input=lambda: sys.stdin.readline().rstrip()
 
def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a
 
show_flg=False
show_flg=True
 
ans=0

n=len(input())

for i in range(n):
    print('x',end='')
print()

Solution (Python):
def solve():
    S = input()
    return 'x' * len(S)


if __name__ == "__main__":
    answer = solve()
    print(answer)

Solution (Python):
s = input()
n = len(s)
s = ""

for i in range(n):
    s = s + 'x'

print(s)

Solution (Python):


s = input()
ans = "x" * len(s)

print(ans)

Solution (Python):
S=input()

A="x"*len(S)

print(A)

Solution (Python):
s=list(input())

for i in range(len(s)):
    print('x',end='')

Solution (Python):
s = input()
answer = ''
for _ in range(len(s)):
    answer += 'x'
print(answer)

Solution (Python):
S = input()
print('x'*len(S))

Solution (Python):
a = input()
l = len(a)
print("x"*l)

Solution (Python):
S = input()
l = len(S)
ans = 'x' * l
print(ans)

Solution (Python):
s = str(input())

len_s = len(s)

print('x'*len_s)

Solution (Python):
s = input()
print('x' * len(s))

Solution (Python):
s = input()
n = len(s)
ans = ""
for i in range(n):
    ans += "x"

print(ans)

Solution (Python):
S=str(input())
ans=""
for i in range(len(S)):
    ans+="x"
print(ans)

Solution (Python):
def resolve():
    s = input()
    print("x"*len(s))
resolve()

Solution (Python):
S=input()

N=len(S)
ans=''
for i in range(N):
    ans+='x'
print(ans)

Solution (Python):

S=input()

result=["x"]*len(S)

print("".join(result))

Solution (Python):
S = str(input())

print('x'*len(S))

Solution (Python):
s = input()
ans = ''
for i in range(len(s)):
    ans += 'x'
print(ans)

Solution (Python):
S = input()
a = 'x'*len(S)
print(a)

Solution (Python):
a=input()
kazu=len(a)
kotae="x"*kazu
print(kotae)

Solution (Python):
print("x"*len(input()))

Solution (Python):
s=input()
n=len(s)
print("x"*n)

Solution (Python):


S = input()

print(''.join(['x' for _ in S]))

Solution (Python):
s = input()

ans = 'x' * len(s)
print(ans)

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):
s = input()

n = len(s)

print("x"*n)

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
S = input()


for n in range(len(S)):
    print("x", end="")

Solution (Python):
def main():
    s = input()
    print("x" * len(s))


if __name__ == '__main__':
    main()

Solution (Python):
s = list(input())
l = len(s)
xlst = ["x"]*l
print("".join(xlst))

Solution (Python):
S=input()
a=len(S)
o=""
for i in range(a):
  o+="x"
print(o)

Solution (Python):
S = input()
lenS = len(S)


print("x"*lenS)

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):
S = input()
n = len(S)
print('x' * n)

Solution (Python):
k = list(input())
ans = ["x"] * len(k)
print("".join(ans))

Solution (Python):
print("x" * len(input()))

Solution (Python):
import sys

def main():
    k = input().replace('\n','')
    a = 'x' * len(k)
    print(a)
if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Solution (Python):
S = input()
i = len(S)
print("x"*i)

Solution (Python):
if __name__=="__main__":
    s = input()

    t = ""
    for i in range(len(s)):
        t += "x"

    print(t)

Solution (Python):
S=str(input())
T=[]
for i in range(len(S)):
  T.append("x")
print("".join(T))

Solution (Python):


s = input()
a = len(s)

print('x'*a)

Solution (Python):
S=input()
print("x"*len(S))

Solution (Python):
S = input()

N = len(S)

print('x' * N)

Solution (Python):
s = input()

l = len(s)
ans = ""
for i in range(l):
    ans += "x"

print(ans)

Solution (Python):
N = input()
s="x"*100
print(s[:len(N)])

Solution (Python):
s = input()
n_s = ''
for i in range(len(s)):
    n_s += 'x'
print(n_s)

Solution (Python):
S = input()

for i in range(len(S)):
    print("x",end="")
print()

Solution (Python):
print('x'*len(input()))

Solution (Python):

import sys


def solve(S: str):
    ans = ['x' for s in S]
    print(''.join(ans))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
slist = list(s)
length = len(slist)

for i in range(length):
    print('x', end='')

Solution (Python):
s=input()
a=len(s)
k="x"*a
print(k)

Solution (Python):





def solv(S):
    return 'x' * len(S)


if __name__ == "__main__":

    S = input()
    ans = solv(S)

    print(ans)

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
s = input()
for _ in range(len(s)):
    print('x', end='')
print()

Solution (Python):
s = input()
print("x"*len(s))