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()
n = len(s)

print("x"*n)

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

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

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

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

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

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

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

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):
S = input()

print('x'*len(S))

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
S = 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())
ans = list()
for i in range(len(S)):
	ans.append('x')
print(''.join(ans))

Solution (Python):

import sys
INF = float("inf")


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


def main():

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


if __name__ == '__main__':
    main()

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

Solution (Python):


S = input()

print('x' * len(S))

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


S = sys.stdin.buffer.readline().decode().rstrip()
print( 'x' * len(S))

Solution (Python):
def read():
    S = str(input().strip())
    return S,

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


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Solution (Python):

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

Solution (Python):



def main():
    import sys
    sys.setrecursionlimit(10**6)
    

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


if __name__ == '__main__':
    main()

Solution (Python):


import sys
sys.setrecursionlimit(300000)


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

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

if __name__ == '__main__':
    main()

Solution (Python):
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
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

Solution (Python):
import sys

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

S = sr()
l = len(S)
answer = 'x' * l
print(answer)

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

Solution (Python):
s = input()

print("x" * len(s))

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    s=SI()
    print("x"*len(s))

main()

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

Solution (Python):


def solve():
    S = input()
    ans = ""
    for moji in S:
        ans += "x"

    print(ans)

if __name__ == "__main__":
    solve()

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


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



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

if __name__ == '__main__':
    main()

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

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