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):
def main():
    S = input().rstrip()
    print("x" * len(S))


if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()

N = len(S)

print('x'*N)

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):
def main():

    S = input()
    return 'x' * len(S)
if __name__ == '__main__':
    print(main())

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

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

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

print(ans)

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

s = input().rstrip()

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

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

len_ =len(u)

tmp = str()

for i in range(len_):
      tmp = tmp + 'x'

print(tmp)

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline

print("x"*len(input().rstrip()))

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
ln = len(input())
print('x'*ln)

Solution (Python):




import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    S = ins()
    return "x" * len(S)


print(solve())

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()

    print('x' * len(S))

    return


if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()

s = "".join(["x" for i in s])
print(s)

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

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

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

Solution (Python):
s = input()

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

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 math
import collections

def main():
  S = input()
  
  lenth = len(S)
  a = ''
  
  for _ in range(lenth):
    a += 'x' 
  print(a)
  
main()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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):
s=input()
print("".join(["x"]*len(s)))

Solution (Python):
s=input('')
t=''
for a in s:
    t=t+'x'

print(t)

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

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

Solution (Python):
import re

N = input()
N = re.sub(r'[A-z]', 'x', N)

print(N)

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

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):
Ss = input().rstrip()

print('x' * len(Ss))

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

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

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

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

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

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

for i in range(len(S)):
    S[i] = 'x'
print(''.join(map(str,S)))

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

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

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

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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

Solution (Python):
mod = int(1e9+7)
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
  	n = len(raw_input())
  	temp = ['x' for _ in range(n)]
  	
  	print(''.join(temp))
    
	
    

main()

Solution (Python):
n = input()

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

print()

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

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

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

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

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

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

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

Solution (Python):
s=input()
con=len(s)
ans=['x']*con
ANS=''
for i in ans:
    ANS+=i
print(ANS)

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

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

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

Solution (Python):
string = input()

print("x" * len(string))

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

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

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

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

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

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

Solution (Python):


s = input()

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

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

print(str)

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

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





if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    solve()

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

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

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

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

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()
for i in range(len(s)):
    print('x', end='')

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

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

L = len(S)

ans = "x" * L

print(ans)

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

Solution (Python):
s = input()

print('x'*len(s))

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

X='x'*l
X=str(X)

print(X)

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

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

Solution (Python):
S = input()
N = len(S)
ans = ["x" for i in range(N)]
print(*ans, sep="")

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

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

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


    
if __name__ == "__main__":
    main()

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

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

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

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

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

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

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


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


if __name__ == "__main__":
	main()

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

Solution (Python):



s = input()

answer = 'x'*len(s)

print(answer)

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

Solution (Python):
s=input()

l = len(s)

print('x'*l)

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

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

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):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") 

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

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

print("x" * n)

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

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
def actual(s):
    return 'x' * len(s)

s = input()
print(actual(s))

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

Solution (Python):

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

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

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

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

Solution (Python):
s = input().rstrip()
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(s.replace(s, 'x' * len(s)))

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    n = len(input())
    ans = 'x' * n
    print(ans)


if __name__ == '__main__':
    solve()

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

for i in 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):
def main():
    s = list(input())

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):

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

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)



from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import copy
from itertools import permutations
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7






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

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

print("x" * N)

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

Solution (Python):
S = input()

print('x' * len(S))

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

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

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


    
main()

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

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

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

print('x'*sLength)

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

Solution (Python):
S = input()

print("x"*len(S))

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")



def main():
    S = input()[:-1]
    print("x" * len(S))


if __name__ == '__main__':
    main()

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

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

Solution (Python):
s = input()

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

print(''.join(X))

Solution (Python):
S = input()

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

print(''.join(X))

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):
T=input()

for i in range(len(T)):
    T=T.replace(T[i],'x')
print(T)

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

Solution (Python):
s = input()

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

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

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

print(s)

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

ans = ''

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

print(ans)

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

Solution (Python):
a=input()

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

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

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

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

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

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

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

Solution (Python):
S = input()

print('x' * len(S))

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

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

Solution (Python):
S = input()
print("{}".format(S.replace(S, 'x' * len(S))))

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

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

Solution (Python):
import re

S = input()

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

Solution (Python):

import sys

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


def main():
    S = readline().rstrip().decode()
    print('x' * len(S))


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
ans = ["x"] * len(s)
print(*ans,sep="")

Solution (Python):
s = str(input())
c = len(s)
ans = ['x' for _ in range(c)]

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

Solution (Python):
s = input()

a = ''

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

print(a)

Solution (Python):
S = input()

print("x"*len(S))

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

print("x" * l)

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

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

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

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

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

Solution (Python):
S = input()
print('x'*len(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()
for i in range(len(S)-1):
  print("x", end="")
print("x")

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

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

Solution (Python):
S = list(input())
n = len(S)
t = 'x'
for i in range(n-1):
  t += 'x'
print(t)

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

Solution (Python):
s = input()

print('x' * len(s))

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

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

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

Solution (Python):
s = input()

l = len(s)

ans = 'x' * l
print(ans)

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

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

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

Solution (Python):
s = str(input())
S = list(s)
for i in range(len(S)):
    S.append('x')
    S.pop(0)
print(''.join(S))

Solution (Python):

S=input()

print("x"*len(S))

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

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

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

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

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

Solution (Python):
s=input()
count=0
for i in s:
    count+=1
print('x'*count)

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

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

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

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

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

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

for c in s:
    new += 'x'

print(new)

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

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

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

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

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

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

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

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

n = len(m)

x = "x" * n

print(x)

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

print('x'*len(s))

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

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

s_len = len(s)

print('x' * s_len)

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

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()
ans = ''
for i in range(len(list(s))):
  ans += 'x'
print(ans)

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

Solution (Python):
s = input()

print('x'*len(s))

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

    N = len(S)
    ans = "x" * N

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

s = input()

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

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

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

Solution (Python):
S = input()

print('x'*len(S))

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    s = list(input())
    print("x"*len(s))
    return 0

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD

combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''


def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''











def main():

    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    s=input()
    a=[i for i in s]
    for i in range(len(s)):
        a[i]='x'
    print(''.join(a))
    
    
    
    


    for i in range(1,n+1,2):
     pass
     


    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

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

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

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):


def f(s):
    n = len(s)
    print(''.join(['x']*n))


s = input()

f(s)

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