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()
t = ''

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

print(t)

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

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

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

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

print(ans)

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

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

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

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

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

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

print(x)

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

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

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

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

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

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

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

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

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

Solution (Python):
import numpy as np

S=input()
S=''.join(['x']*len(S))
print(S)

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

Solution (Python):
string = input()
replaced_string = ''
while len(replaced_string) < len(string):
    replaced_string += 'x'
print(replaced_string)

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

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

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

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

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

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

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):
str = input()
print(len(str) * "x")

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

def answer(s: str) -> str:
    ans = 'x' * len(s)
    return ans

print(answer(s))

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

answer=[]
s=0
while s<a:
    answer.append('x')
    s=s+1

y=''.join(answer)
print(y)

Solution (Python):
s = input()

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

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

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

Solution (Python):
def atc_154b(S: str) -> str:
    return "x" * len(S)

S_input = input()
print(atc_154b(S_input))

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

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

Solution (Python):
s = input()

print(len(s) * "x")

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

print(A)

Solution (Python):
S=input()
list_s = list(S)
for i in range(0, len(list_s)):
    list_s[i] = "x"

print(''.join(list_s))

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

Solution (Python):
S = input()



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

Solution (Python):



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

print(answer[1:len(S) + 1])

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

from  collections import defaultdict
from collections import Counter
import bisect
def main():
    S_ = S()
    x = len(S_)
    ans = 'x' * x
    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
S = input()

result = ''
for _ in S:
    result += 'x'

print(result)

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

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

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

Solution (Python):
s = input()

print(len(s) * "x")

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

for i in range(0, len(s)):
    s[i] = "x"

convert = "".join(s)
print(convert)

Solution (Python):
s = input()

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

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

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

Solution (Python):
S = input()

print(len(S) * 'x')

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

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

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

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

Solution (Python):
word = input()
print(word.replace(word, 'x' * len(word)))

Solution (Python):
s = input()

n = len(s)

kotae = "x"*n

print(kotae)

Solution (Python):
def answer(s: str) -> str:
    return 'x' * len(s)

def main():
    s = input()
    print(answer(s))

if __name__ == '__main__':
    main()

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

a = len(S)

print('x' * a)

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

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

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

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

Solution (Python):
S=str(input())
def kinshi(S:str):
    len_count=len(S)
    return("x"*len_count)

print(kinshi(S))

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

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

Solution (Python):

def main():
    print('x' * len(input()))


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
S=input()

print("x"*len(S))

Solution (Python):

S = str(input())
length = len(S)


print("x" * length)

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

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

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

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

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):

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

if __name__ == "__main__":
    main()

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

Solution (Python):
S = input()

ans = ''.join(['x' for ch in S])
print(ans)

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

Solution (Python):

def calc_digit_sum(num):
    digits = sums = 0
    while num > 0:
        digits += 1
        sums += num % 10
        num //= 10
    return digits, sums


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

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

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

Solution (Python):
s=list(input())
n=len(s)
ans=['x']*n

print(''.join(ans))

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

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

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

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

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

Solution (Python):

S = input()

print("x"*len(S))

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

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

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

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

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

Solution (Python):
a=input()
b=int(len(a))
c="x"
d="x"
i=0
while i<b-1:
  d=d+c
  i=i+1
print(d)

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

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

print("x" * N)

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

Solution (Python):
S = input()
leng = len(S)
ans = ''

for n in range(leng):
    ans += 'x'

print(ans)

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


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

ans = ''
for i in range(n):
  ans += S[i]

print(ans)

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

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

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

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

Solution (Python):
import os, sys, re, math

S = input()

print('x' * len(S))

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

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

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

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

print('x'*len(S))

Solution (Python):
S = input()
s_list = list(S)
ans = ''

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

print(ans)

Solution (Python):
S = input()

print('x'*len(S))

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

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

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

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

Solution (Python):
s = input()

s = 'x'*len(s)

print(s)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()
    l = len(S)

    print("x" * l)


if __name__ == '__main__':
    main()

Solution (Python):

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):


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

Solution (Python):
S = input()

print('x'*len(S))

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
S= input()

print('x'*len(S))

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

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):
def main():
    s = input()
    ans = len(s) * "x"

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
s = input()

S = list(s)

n = len(S)

ans = ['x'] * n

ANS = ''.join(ans)

print(ANS)

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

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

Solution (Python):
S=input()

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

print(ch)

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

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

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

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

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

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

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

Solution (Python):

S = input()

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

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

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

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

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

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

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

print(ans)

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

Solution (Python):
S = input()

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

print(res)

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

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

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

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

Solution (Python):
S = input()

print('x'*len(S))

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin 

def main():
    s = input()
    print(len(s)*"x")
    
if __name__ == "__main__":
    main()

Solution (Python):
S = input()

print(len(S)*"x")

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

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

Solution (Python):
import sys
S = sys.stdin.read().strip()
print('x' * len(S))

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

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

Solution (Python):
s=input()

a=['x' for _ in  range(len(s))]
ans=''
for aa in a:
  ans+=aa
print(ans)

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

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

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

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

Solution (Python):

S = input()
ans = ''.join(['x' for _ in range(len(S))])
print(ans)

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

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

Solution (Python):
S = input()
for i in range(len(S)):
    tmp = S[i]
    S = S.replace(tmp,"x")
print(S)

Solution (Python):
S = input()

print('x'*len(S))

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

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

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

Solution (Python):
import re

s = str(input())

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

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

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

if '__main__' == __name__:
    resolve()

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

Solution (Python):
s = input()

print('x'*len(s))

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

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

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

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

Solution (Python):
S = input()
i = 0
while i < len(S):
    print('x', end='')
    i += 1

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

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(S: str):
    return 'x'*len(S)


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

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

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


if __name__ == "__main__":
    main()

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

if __name__ == "__main__":
    solve()

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

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

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

print('x' * len(S))

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

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

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

Solution (Python):
s = input()

print(len(s) * "x")

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

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

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

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

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

main()

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):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

print(''.join(ans))

Solution (Python):
s = input()

print('x'*len(s))

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

    print('x' * L)


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
s = input()

print("x" * len(s))

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

Solution (Python):
S=input()
N=len(S)
M=[]
for i in range(N):
  M.append('x')
  
L=''.join(M)
print(L)

Solution (Python):
def i_miss_you():
    
    S = input()
    
    string = ''
    
    for _ in range(len(S)):
        string += 'x'
    return string

result = i_miss_you()
print(result)

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

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

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

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

Solution (Python):
s=input()

print(len(s)*"x")

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

Solution (Python):






s = input()

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

print("")

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

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

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    return ''.join(['x']*len(input()))


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

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

Solution (Python):










































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    
    
    
    
    
    
    
    
    
    

    result = 'x' * len(S)

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['sardine']
        lines_export = ['xxxxxxx']
    if pattern == 2:
        lines_input = ['xxxx']
        lines_export = ['xxxx']
    if pattern == 3:
        lines_input = ['gone']
        lines_export = ['xxxx']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):



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

if __name__ == '__main__':
  main()

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

a = 'x'*n
print(a)

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

Solution (Python):
S = input().strip()
N = len(S)
print(*["x"]*N, sep="")

Solution (Python):
s = input()

[print("x",end="") for x in range(len(s))]

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

Solution (Python):
import sys
input = sys.stdin.readline
s=input().strip()
n=len(s)
print("x"*n)

Solution (Python):
import sys
S = input()

if not S.islower(): sys.exit()
if not ( 1 <= len(S) <= 100 ): sys.exit()

print('x'*len(S))

Solution (Python):

import collections as cl
import sys


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


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


main()

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

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

Solution (Python):
S = input()
x = len(S)
list = []

for i in range(x):
    list.append('x')
    
print(''.join(list))

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

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



S = _S()

def main():
    ans = ''
    for _ in range(len(S)):
        ans += 'x'
    return ans
print(main())

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

print('x' * len(s))

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

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

Solution (Python):
S = input()

a = ""

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

print(a)

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

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

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
n = input()
print(n.replace(n,'x'*len(n)))

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Solution (Python):
s = input()

print('x'*len(s))

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

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

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

print("x"*s_count)

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

Solution (Python):

s = input()
n = len(s)

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

print(ans)

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

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

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

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

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

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

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

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

l=len(s)

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

Solution (Python):

import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	
	sys.stdin = open(name)

s = input()



ans=[]
for i in range(len(s)):
    ans.append("x")

print("".join(ans))

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

Solution (Python):


S = input()

print("x" * len(S))

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

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

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

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

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

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

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

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

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

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

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

print(K)

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

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

Solution (Python):
S = input()

N = len(S)
s = 'x'*N
print(s)

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

res = 'x' * long
print(res)

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

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

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

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

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

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    print("".join(["x" for _ in range(len(_S()))]))

main()

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

Solution (Python):
S = input()

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

print(ans)

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

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

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

Solution (Python):
N=input()
i=0
while i<len(N):
  print("x" ,end='')
  i+=1

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

Solution (Python):

import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

s = input()

print('x'*len(s))

Solution (Python):
if __name__ == '__main__':
	
	s = input()
	print("x" * len(s))

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

main()

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

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

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

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

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

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

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

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

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

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