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



Sample input:
sardine


Sample output:
xxxxxxx

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
String = input()
output_string = ''
for i in range(len(String)):
    output_string+='x'

print(output_string)

Submission status: Accepted

Solution code:
s = input()

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

length = len(s)

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

Submission status: Accepted

Solution code:
s = input()

l = len(s)

print('x' * l)

Submission status: Accepted

Solution code:
S = input()

print(len(S) * "x")

Submission status: Accepted

Solution code:
# B - I miss you...

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

Submission status: Accepted

Solution code:
S = input()

print(S.replace(S,"x"*len(S)))

Submission status: Accepted

Solution code:
S = input()

n = len(S)
ans = ["x" for i in range(0,n,1)]
answ = "".join(ans)
print(answ)

Submission status: Accepted

Solution code:
s_count = len(list(input()))
print('x'*s_count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
X=S
for i in range(len(S)):
    X=X.replace(S[i], 'x')
print(X)

Submission status: Accepted

Solution code:
s=input()

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

print(''.join(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(*(["x"] * len(input())), sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s=input()
#print(len(s))
x=0
x="x"*len(s)
print(x)

Submission status: Accepted

Solution code:
S=input()
X=['x' for i in range(len(S))]
print(''.join(X))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import re
s = input()
print(re.sub(r'[a-z]','x',s))

Submission status: Accepted

Solution code:
s=input()
ans=['x' for i in range(len(s))]
print(*ans,sep='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

print("x" * len(S))

Submission status: Accepted

Solution code:
S = str(input())

count = len(S)
X = ""

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

print(X)

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

print("x" * len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
s = len(S)
Ans = str()
for i in range(s):
    Ans += "x"
print(Ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
#########行列読み込み ##############################################
"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""
##################################################################
#########入力系####################################################
"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""
##################################################################
s=list(input())
#print(s)
ans = []
for i in range(len(s)):
    print("x",end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s=input()


print("x"*len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
s = open(0).read().rstrip()
print("x" * len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a = ["x"]*len(s)
ans = "" 
for i in a:
  ans += i
  
print(ans)

Submission status: Accepted

Solution code:
S = input()
ans = ''
for i in S:
    ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
# AtCoder
S = input()
n = len(S)
print('x'*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
length = len(s)
array = []

for i in range(0,length):
    array.append("x")

print(''.join(array))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
l=[]
for i in w[:]:
    l.append(i)
a=len(w)
for i in range(a):
    l[i]="x"
print(*l,sep="")

Submission status: Accepted

Solution code:
string = input()
print("x"*len(string))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

x=[]
for i in range(0,len(s)):
    x.append('x')
    
x = ''.join(x)
print(x)

Submission status: Accepted

Solution code:
S= input()

print("x"*len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
S = input()
ans = []

for i in range(len(S)):
    ans.append("x")

print("".join(ans))

Submission status: Accepted

Solution code:
x = input()
result = ''

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

Submission status: Accepted

Solution code:
S=input()

print('x'*len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = len(input())
print("x"*n)

Submission status: Accepted

Solution code:
S=input()
A='x'
for i in range(1,len(S)):
  A=A+'x'

print(A)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
from fractions import gcd
#from math import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string=input()
list=[]
for s in string:
  s='x'
  list.append(s)
print(''.join(list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
S = len(s)

print("x"*S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(str(input()))
L = len(S)

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

S = ''.join(S)
print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
Slist = list(S)
l = len(S)

for i in range(l):
    Slist[i] = 'x'
    i = i + 1

Schange = "".join(Slist)  
print(Schange)

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip()
l = len(s)
print('x'*l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def change(n):
    n="x"
    return n

s = list(input())
b = list(map(change,s))
c = "".join(b)
print(c)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
S = input()

print("x" * len(S))

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 154: B – I miss you...
print('x' * len(input()))

Submission status: Accepted

Solution code:
string=input()
print("x"*len(string))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

ans = "x" * len(S)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(out)

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No"):
    print([yes, no][not v])


def main():
    """エントリーポイント"""
    S = input(str)
    print("x" * len(S))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
a = input()
length = len(a)
string = "x"*length
print(string)

Submission status: Accepted

Solution code:
s = input()

print("x"*len(s))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

s = input()

print("x" * len(s))

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import re

def main():
    S = input()
    print(re.sub(r'[a-z]', "x", S))
    

main()

Submission status: Accepted

Solution code:

S = str(input())

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S    = input()
out  = ''
for ii in range( len(S) ):
    out = out+'x'
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
l = len(S)
word = []
for i in range(l):
  word.append("x")
print("".join(word))

Submission status: Accepted

Solution code:
def nyu():
    S = list(map(str,input()))
    return S


def check(S):
    out =""

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



            
S = nyu()
check(S)
#print(S)

Submission status: Accepted

Solution code:
S = input();

ans = "x" * len(S);  
print(ans);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = ["x"]*len(S)

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = raw_input()
A = len(S)
B = ''
for i in range(A):
    B += "x"
print B

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

S = input().rstrip()
ans = ""
for _ in range(len(S)):
    ans += "x"
print(ans)

Submission status: Accepted

Solution code:
p = input();l = list(p)
for i in range(0,len(l)):
    l[i]='x'
print(''.join(l))

Submission status: Accepted

Solution code:
s=input()
t=len(s)

print("x"*t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
count=0
for i in s:
    count+=1

print("x"*count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
g = input().strip()
print(len(g)*'x')

Submission status: Accepted

Solution code:
mozi=input()
l=len(mozi)

print("x"*l)

Submission status: Accepted

Solution code:
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#https://atcoder.jp/contests/abc154/tasks/abc154_b
length = len(input())
print("x"*length)

Submission status: Accepted

Solution code:
[S] = [str(i) for i in input().split()]
p_string = "x"
for i in range(len(S)-1):
    p_string = p_string + "x"
print(p_string)

Submission status: Accepted

Solution code:
S=input()
x=len(S)
ans=[]
for i in range(x):
    ans.append("x")

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
for i in range(len(s)):
  s=s.replace(s[i],'x')
print(s)

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
    s = s.replace(s[i], 'x')
print(s)

Submission status: Accepted

Solution code:
a = input()
b = ""
for i in a:
    b += "x"
print(b)

Submission status: Accepted

Solution code:
s = input()

num = len(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B

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

Submission status: Accepted

Solution code:
s = list(input())
a = []
for i in s:
  a.append("x")
cona = ''.join(a)
print(cona)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


s = input()

f(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=input()
l=len(s)
t=[]
for i in range(l):
  t.append('x')

n=''.join(t)
print(n)

Submission status: Accepted

Solution code:
S = list(input())
N = len(S) #lenはリアル個数を出力

print("x" * N)

Submission status: Accepted

Solution code:
S = list(input())
N = len(S) #lenはリアル個数を出力
l = []
for i in range(N):
    l.append("x")
print("".join(l))

Submission status: Accepted

Solution code:
S=input()
L=len(S)

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

Submission status: Accepted

Solution code:
S = input()

ans=list()
for i in range(len(S)):
    print('x',end='')

Submission status: Accepted

Solution code:
s=input()
a=[str(c) for c in s]
l=len(a)
for i in range(l):
  a[i]="x"
  print(a[i],end="")

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    print("x" * len(str(readline().rstrip().decode('utf-8'))))


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC154 -virtual
# A
# B
if True: print('x'*len(input()))
# C
if False:
    N=int(input())
    A=[int(i) for i in input().split()]
    print('YES' if len(A)==len(set(A)) else 'NO')
# D
# E
# F

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
for a in s:
    print("x",end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
string = list(s)
cnt = len(string)
print("x" * cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input().strip('\n')
print('x'*len(S))

Submission status: Accepted

Solution code:
s = input()

ans = "x" * len(s)

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
length = len(S)
print('x' * length)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os

def main():
	strings = input()
	result_str = ""
	for s in strings:
		result_str += "x"
	print(result_str)

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
S = str(input())
length = len(S)
X = ['x']*length
print("".join(X))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("x"*n)

Submission status: Accepted

Solution code:
import re
S = input()
S = re.sub(r"[\w+]", "x", S)
print(S)

Submission status: Accepted

Solution code:

S = input()

print('x' * len(S))

Submission status: Accepted

Solution code:
for i in input():print("x",end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    print(solve(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
A = 0
for a in S:
    A += 1
print("x" * A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#--I miss you...
S = input()
num = int(len(S))

output = [0] * num
for i in range(num):
  output[i] = "x"

print(''.join(output))

Submission status: Accepted

Solution code:
S = input()
L = int(len(S))
print("x"*L)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import math
def print_ans(S):
    """Test Case
    >>> print_ans("sardine")
    xxxxxxx
    >>> print_ans("xxxx")
    xxxx
    >>> print_ans("gone")
    xxxx
    """
    print("x" * len(S))


if __name__ == '__main__':
    S = input().rstrip()
    print_ans(S)

Submission status: Accepted

Solution code:
s = input()

length = len(s)
out = ['x']*length

print("".join(out))

Submission status: Accepted

Solution code:
leng = len(input())
ans = 'x' * leng
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print('x'*l)

Submission status: Accepted

Solution code:
S=list(map(str,input()))
print("x"*len(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())

print("x"*len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
N = int(len(S))

#print(S,N)
#for i in range(N-1):
print("x"*N)

Submission status: Accepted

Solution code:
def main():
    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
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S=input()

Ans=[]
for i in range(len(S)):
    Ans.append("x")

Ans=("").join(Ans)
    
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

len = len(S)
x = 'x'

print(len*x)

Submission status: Accepted

Solution code:
S=input()
L=len(S)
U="x"*L
print(U)

Submission status: Accepted

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

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

print("".join(S))

Submission status: Accepted

Solution code:
S = input()

x = 'x' * len(S)

output = x
print(output)

Submission status: Accepted

Solution code:
import re

# 入力
S = input()

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