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 = input()

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

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

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

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

Solution (Python):

S=input()

len_S = len (S)

A=""
for i in range(len_S):
    A+='x'

print(A)

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

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

Solution (Python):



S = input()

L=len(S)
A='x'
for ii in range(L-1):
    A=str(A)+'x'

print(A)

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

if __name__ == '__main__':
  main()

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

Solution (Python):
s = input()

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

print(ans)

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

Solution (Python):
string = input()
count = len(string)

string_li = []

for i in range(count):
    string_li.append('x')

string_x = "".join(string_li)

print(string_x)

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

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

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

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

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

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

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

Solution (Python):
s = input()

result = ''

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

Solution (Python):
import sys
f = sys.stdin
S = f.readline()[:-1]
print(''.join(['x']*len(S)))

Solution (Python):
S=input()


print('x'*len(S))

Solution (Python):
S = input()

length = len(S)

print("x" * length)

Solution (Python):
S = input()

print('x' * len(S))

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

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

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

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

output = "x"*length

print(output)

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

Solution (Python):


if __name__ == "__main__":
    S = input()
    i = len(S)
    ret = "x" * i
    print(ret)

Solution (Python):
args = input()

print("x"*len(args))

Solution (Python):
s = input()

s_len = len(s)

print("x" * s_len)

Solution (Python):

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

print(ans)

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

Solution (Python):
S = input()

s_count = len(S)
result = ''
for v in range(s_count):
  result = result + 'x'

print(result)

Solution (Python):
len_i = len(input())
o = ''
for n in range(0, len_i):
    o += 'x'
print(o)

Solution (Python):
a = list(map(str, input().split()))
b = len(a[0])
c = "x" * b
print(c)

Solution (Python):


import sys
import math

from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
sys.setrecursionlimit(1000000000)


def lcm(a, b):
    return (a * b) // gcd(a, b)



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

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

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

Solution (Python):

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

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

Solution (Python):
S = str(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()
print('x'*len(s))

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

Solution (Python):
import re

a = str(input())
print(re.sub('[a-z]', 'x', a))

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

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

length = len(s)

res = ''


print('x' * length)

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

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

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

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

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    u = lines[0]

    return (u,)


def solve(u):
    
    result = ''.join(['x' for e in u])

    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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):
S = input()

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
S = input()
memo = len(S)
result = ''
for i in range(0,memo,1):
  result += 'x'
print(result)

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

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

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

print('x'*ans)

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

Solution (Python):
S = input()

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

print(answer)

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

Solution (Python):
import re
s = input()

sst = re.sub(r'[a-z]', "x", s)
print(sst)

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

Solution (Python):
def Main(S):
    N = len(S)
    return "".join(['x' for _ in range(N)])

def main():
    S = str(input())
    print(Main(S))

if __name__ == '__main__':
    main()

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

Solution (Python):
class InputString():
    def __init__(self, S):
        self.S = S
        self.input_length = len(S)
        self.output = ""

    def toX(self):
        for _ in range(self.input_length):
            self.output += "x"


S = input()
input_string = InputString(S)
input_string.toX()
print(input_string.output)

Solution (Python):
s = input()

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

Solution (Python):

input_line = input()
ChangeS = ""
for i in range(len(input_line)):
  ChangeS = ChangeS + "x"
print(ChangeS)

Solution (Python):
slist = list(raw_input())

snum = len(slist)

ret = ""

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

print ret

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

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

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

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

Solution (Python):

s = input()
num = len(s)

print(num*"x")

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

print(s)

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

Solution (Python):
s = input()
o = ['x' for _ in s]
print(''.join(o))

Solution (Python):

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

Solution (Python):


s=input()
len=len(s)

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

Solution (Python):
s = input()
l = len(s)
rep = ['x' for _ in range(l)]
print(''.join(rep))

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

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

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

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

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

Solution (Python):
S = input()

str_len = len(S)

ans = ''

for s in range(str_len):
    ans += 'x'

print(ans)

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

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

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()
print("x"*len(s))

Solution (Python):
S = input()

ans = 'x'
for ii in range(len(S)-1):
  ans = ans + 'x'

print(ans)

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

Solution (Python):
inpl = lambda: list(map(int,input().split()))
S = input()
N = len(S)
print('x'*N)

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
S=input()
L=str(len(S))
L=int(L)-1
ans='x'
c=0
while not (int(c)==int(L)):
  ans=ans+'x'
  c=c+1
print(ans)

Solution (Python):
S = input()

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

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

Solution (Python):
s = input()

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

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

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

print('x' * l)

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

print(b)

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

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

Solution (Python):
S = input()
ans = ''
for _ in S:
    ans += 'x'
print(ans)

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

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

print("x" * len(moji))

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

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

def print_n_word(word,n):
    result = ""
    for i in range(n):
        result = result+word
    return result


print(print_n_word("x",n))

Solution (Python):
S = input()

outS = "x" * len(S)
print(outS)

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

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

Solution (Python):
s = input()

print('x'*len(s))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict

IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())

u=input()

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


N=int(100005)
a=[int(0) for i in range(N)]

Solution (Python):
def main():
  T = str(input())
  res = ""
  for t in T:
    res += "x"
  print(res)
          
if __name__ == "__main__":
  main()

Solution (Python):
s = input()
t = list(s)
k = ""

for i in range(0, len(t)):
  k = k + "x"

print(k)

Solution (Python):


S=input()

print("x"*len(S))

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

Solution (Python):
s = input()

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

Solution (Python):
a = str(input())
out = ""
for i in a:
    out = out + "x"

print(out)

Solution (Python):
S = input()

S_size = len(S)

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

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

    return

resolve()

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

for char in S:
    S_new += 'x'
print(S_new)

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

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

Solution (Python):

import numpy as np

s = str(input())

len_s = len(s)

ans = ''

for i in range(len_s):
    ans += 'x'

print(ans)

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


ans = ""
ans = str(ans)

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

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

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


if __name__ == '__main__':
    main()

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

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

print("x"*S)

Solution (Python):
s = input()

num = len(s)

print("x" * num)

Solution (Python):
S = input()

length_S = len(S)

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

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

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

ans = ''

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

print(ans)

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

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

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

Solution (Python):
def conv(n):
    ans = ''
    for i in range(n):
        ans += 'x'
    return  ans

if __name__ == "__main__":
    s = input()
    print(conv(len(s)))

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

Solution (Python):
moji = list(input())
res = ""

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

print(res)

Solution (Python):
S = input()
nums = len(list(S))
anslist = ['x']*nums
ans = ''
for a in anslist:
    ans += a
print(ans)

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

Solution (Python):
S = input()
len = len(S)
moji = ""

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

print(moji)

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

Solution (Python):
s = input()

print('x' * len(s))

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

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

Solution (Python):
s = input()


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


print(mojiretsu)

Solution (Python):
s = input()

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

print(ans)

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

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

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

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

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

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

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

Solution (Python):
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    if type(s) != type('str'):
        s=str(s)

    sys.stderr.write(s+'\n')
    return

def main():
    s = input()
    print('x' * (len(s)-1))
    return

if __name__ == '__main__':
    main()

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

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

Solution (Python):


S = input()
out = "";
for i in range(len(S)):
    out += "x"
print(out)

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

Solution (Python):
S = input()
print(''.join(['x'for s in S]))

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

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

    print("x" * len(S))


if __name__ == "__main__":
    main()

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

S_len = len(S)

X = ""

for i in range(S_len):
  X += "x"

print(X)

Solution (Python):
s = input()

l = len(s)

v = 'x'*l

print(v)

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

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
s = input()

t = ""
l = len(s)

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

print(t)

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

Solution (Python):
s=input()

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

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

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
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 LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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

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

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

Solution (Python):
S = input()
for s in S:
    print("x",end="")

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

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

Solution (Python):
s = input()

s_cnt = len(s)

ans = ''
for _ in range(s_cnt):
  ans += 'x'

print(ans)

Solution (Python):
S=str(input())
p=len(S)
t=[]
for i in range(p):
  t.append('x')
q=''.join(t)
print(q)

Solution (Python):
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(str, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    S, T= LS()
    A,B= LI()
    U= input().rstrip()



    if(S==U):
        print(A-1,B)
    else:
        print(A,B-1)


    
    return




def B():
    A=input().rstrip()
    ans='x'
    for i in range(len(A)-1):
        ans+='x'
    print(ans)
        
    


    return




def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def C():
    N, M = LI()
    P=[]
    S=[]
    count=set([])
    ans=[0]*1000000
    realans=0
    for i in range(M):

        p,s=input().split()
        p=int(p)
        if s=='AC':
            realans+=ans[p]
            count.add(p)
            ans[p]=0
        if s=='WA' and p not in count:
            
            ans[p]+=1
  


    
    print(len(count),realans)
    

        


        




def D():

    H, W= LI()
    S=[]
    d=0
    for i in range(H):
        tmp=input().rstrip()
        c=0
        for j in tmp:
            if '.'==j:
                S.append(d*100+c)
            c+=1
        d+=1
    print(S)



    return




def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return




def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    



def solution(S):
    
    N = len(S)

    pass



if __name__ == '__main__':

    B()

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

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

    
main()

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

Solution (Python):
a = input()

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

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

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

print(''.join(map(str,s)))

Solution (Python):


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

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

for i in range(len(S)):
    S[i] = "x"
print("".join(S))

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

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

print(ans)

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

print(ans)

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

for s in range(len(S)):
  S[s] = 'x'
  
print(''.join(S))

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

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

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

print(ans)

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

Solution (Python):
h=input()

ans = len(h)

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
import numpy as np

s = input()

s_c = 'x' * len(s)

print(s_c)

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

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

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

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

Solution (Python):
s = input()

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

print(a)

Solution (Python):
s = input()

l = len(s)

print("x" * l)

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

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

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

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

Solution (Python):
print(''.join(['x'] * len(list(input()))))

Solution (Python):
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

S = read_str()

def solve():
    ans = ''
    for i in range(len(S)):
        ans += 'x'
    return ans

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

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

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

Solution (Python):

from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) 
A = [int(input()) for _ in range(N)] 
lst = [list(map(int,input().split())) for i in range(M)] 
"""

S = input()

ans = 'x' * len(S)

print(ans)

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

output = ''.join(str("x") for n in range(x))
print(output)

Solution (Python):
s = input()

ans = ["x"] * len(s)
print("".join(ans))

Solution (Python):
import re

S = input()

print( re.sub(r'[a-z]', 'x' , S ) )

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

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

Solution (Python):

import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

S = read().strip().decode("utf-8")

answer = "".join(["x" for _ in list(S)])
print(answer)

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

Solution (Python):
S = input()

print("x"*len(S))

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

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

Solution (Python):
content = input()
length = len(content)
temp = "x" * length
print(temp)

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

Solution (Python):
input_S = input()
 

length_S = len(input_S)

result=[]
for i in range(length_S):
    result.append("x")


print(''.join(result))

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

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

print(ans)

Solution (Python):
S = input().rstrip().split(' ')[0]
st = ""
for i in range(len(S)):st+="x"
print(st)

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

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

print(ans)

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

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

Solution (Python):
def main():
    S = input()
    N = len(S)
    res = ""
    for n in range(N): res+= "x"
    print(res)

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

S = str(input())

print("{}".format("x" * len(S)))

Solution (Python):


s3 = input()
s = ""
l = len(s3)

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

print(s)

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

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

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

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

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

Solution (Python):
s = input()

print('x' * len(s))

Solution (Python):



S = input()
strLen = len(S)
output = ""

for i in range(strLen):
    output += "x"


print(output)

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()
print('x'*len(s))

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

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

Solution (Python):
s = input()

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

print(string)

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

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

Solution (Python):
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass

n = len(l())
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()
print("x"*len(S))

Solution (Python):
s=input()

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

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

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

print(str_s)

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

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

Solution (Python):
S = input()

print('x'*len(S))

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

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

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

i = 1
while i <= x:
  print("x", end="")
  i += 1

Solution (Python):
S = input()

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

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

print('x'*len_S)

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

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

Solution (Python):
import re
s=input()
s = re.sub('.', "x",s)

print(s)

Solution (Python):
s = input()


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


print(result)

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

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

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

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

print(x)

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

s = input().strip()
print(re.sub('[a-z]', 'x', s))

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

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

for s in range(len(S)):
	ret.append('x')

print(''.join(ret))

Solution (Python):
s = input().rstrip('\n');

ans = ['x'] * len(s);

print(''.join(ans));

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

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

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

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

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    S = i2s()
    print('x'*len(S))
    return

main()

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