Problem:
 Score : 200 points    Problem Statement You are given a string S of length N consisting of lowercase English letters, and an integer K .
Print the string obtained by replacing every character in S that differs from the K -th character of S , with * .      Constraints  1 \leq K \leq N\leq 10  S is a string of length N consisting of lowercase English letters.  N and K are integers.         Input Input is given from Standard Input in the following format:  N  S  K       Output Print the string obtained by replacing every character in S that differs from the K -th character of S , with * .        Sample Input 1 5
error
2      Sample Output 1 *rr*r  The second character of S is r . When we replace every character in error that differs from r with * , we get the string *rr*r .       Sample Input 2 6
eleven
5      Sample Output 2 e*e*e*       Sample Input 3 9
education
7      Sample Output 3 ******i**

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
import re
N = int(input())
S = input()
K = int(input())
print(re.sub('[^'+S[K-1]+']', '*', S))

Solution (Python):
N = int(input())
S = list(input().strip())
K = int(input())

K = K - 1

for i in range(N):
    if S[K] != S[i]:
        S[i] = "*"

print(''.join(S))

Solution (Python):
n=int(input())
s=list(input())
k=int(input())

for i in range(n):
  if s[i] != s[k-1]:
    s[i]="*"
print(*s,sep="")

Solution (Python):
input()
S = input()
K = int(input())

c = S[K -1]
for i in S:
    if i != c:
        print('*', end='')
    else:
        print(i, end='')

Solution (Python):
input()
S = input()
K = int(input())

for s in S:print(s if s==S[K-1] else "*", end="")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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, insort, insort_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


B = INT()
S = input()
K = INT()

ans = ""
for x in S:
	if x != S[K-1]:
		ans += "*"
	else:
		ans += S[K-1]
print(ans)

Solution (Python):
n=int(input())
s=list(input())
k=int(input())

X=s[k-1]

for i in range(n):
    if s[i]!=X:
        s[i]='*'

print(''.join(s))

Solution (Python):
N=int(input())
S=input()
K=int(input())

ans=""
d=S[K-1]
for i in range(N):
    p = S[i] if S[i]==d else "*"
    ans +=p
print(ans)

Solution (Python):
n=int(input());s=input();k=int(input());print(''.join([i if i==s[k-1]else'*'for i in s]))

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    s=input()
    k=int(input())
    l=s[k-1]

    ans=""
    for i in s:
        if i == l:
            ans+=i
        else:
            ans+="*"
    print(ans)

Solution (Python):
n=int(input())
s=input()
k=int(input())
b=s[k-1]
ss=""
for a in s:
    if a!=b:
        ss+="*"
    else:
        ss+=a
print(ss)

Solution (Python):
input()
S = input()
k = int(input())
for s in S:print(s if s==S[k-1] else '*',end='')

Solution (Python):
N=int(input())
A=input()
x=int(input())

for i in range(N):
    if A[i]!=A[x-1]:
        A=A.replace(A[i],"*")
        
print(A)

Solution (Python):
input()
s = input()
n = int(input())
print(*[i if i==s[n-1] else "*" for i in s], sep='')

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




N = I()
S = S()
K = I()

l = S[K-1]

for s in S:
  print(s if s == l else "*" ,end="")

Solution (Python):
n = input()
s = input()
k = int(input())
c = s[k-1]
res = ""
for i in range(len(s)):
    if s[i] == c:
        res+= c
    else:
        res += "*"
print(res)

Solution (Python):
n = int(input())
s = list(input())
k = int(input())
e = s[k-1]
ans = []
for i in s:
    if i != e:
        ans.append("*")
    else:
        ans.append(i)
print("".join(ans))

Solution (Python):
n = int(input())
s = list(input())
k = int(input())
c = s[k-1]

for i in range(n):
    if s[i] != c:
        s[i] = "*"

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

Solution (Python):
N = int(input())
S = input()
K = int(input())

a = S[K-1]
for i in S:
    if i != a:
        print('*',end='')
    else:
        print(i,end='')

Solution (Python):
N = int(input())
S = input()
K = int(input())
t = S[K-1]
ans = ''
for s in S:
  if s == t:
    ans += s
  else:
    ans += '*'

print(ans)

Solution (Python):
n=int(input())
s=input()
k=int(input())
ans=""
for i in range(n):
    if s[k-1]==s[i]:
        ans+=s[i]
    else:
        ans+="*"
print(ans)

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










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

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
s = list(input())
k = I() - 1
p = s[k]
for i in range(n):
    if p != s[i]:
        s[i] = '*'
print(*s,sep='')

Solution (Python):
n=input()
s=input()
m=s[int(input())-1]
for x in s:
    if m==x:p=x
    else:p="*"
    print(p,end="")
print()

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
n = int(input())
s = input()
k = int(input())
a = s[k-1]
ans = ''
for b in s:
  if b == a:
    ans += a
  else:
    ans += '*'
print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())
tmp = s[k - 1]
for i in range(n):
    if s[i] != tmp:
        s = s[:i] + "*" + s[i + 1:]
print(s)

Solution (Python):
n=int(input())
s=list(input())
k=int(input())

for i in range(n):
    if s[i]!=s[k-1]:
        s[i]="*"
print("".join(s))

Solution (Python):
n = int(input())
s = input()
rename = int(input())
dum = s[rename-1]
ans = ""
for i in range(n):
    if s[i] == dum:
        ans += dum
    else:
        ans += "*"
print(ans)

Solution (Python):
n= int(input())
l= input()
c=int(input())
c=l[c-1]
ans=""
for i in l:
   if i != c:
      ans+="*"
   else:
      ans+=c
print(ans)

Solution (Python):
int(input())
S = input()
K = int(input())

for s in S:print(s if s==S[K-1] else '*', end='')

Solution (Python):
n = int(input())
s = list(input())
k = int(input())

c = s[k-1]
for i in range(n):
    if s[i] != c:
        s[i] = '*'
for i in s:
    print(i ,end='')
print()

Solution (Python):
def f06():
    n=int(input())
    S=input()
    k=int(input())
    for s in S:
        print(s if s==S[k-1] else '*', end='')
f06()

Solution (Python):
N=int(input())
S=input()
K=int(input())
ans=''
for i in range(N):
    if S[i] != S[K-1]:
        ans += '*'
    else:
        ans += S[i]
print(ans)

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    N = int(input().rstrip())
    S = (input().rstrip())
    str = list(S)
    K = int(input().rstrip())
    s = str[K-1]
    for i in range(N):
        if(str[i] != s):
            str[i] = "*"
    print(''.join(str))

if __name__ == '__main__':
    solve()

Solution (Python):
n=int(input())
s=input()
k=int(input())
a=[]
for i in range(n):
  if s[i]!=s[k-1]:
    print("*",end="")
  else: print(s[i],end="")

Solution (Python):
n = int(input())
s = input()
k = int(input())

char = s[k-1]

for i in range(n):
    if s[i] == char:
        print(s[i], end='')
    else:
        print('*', end='')

Solution (Python):
N = int(input())
S = input()
K = int(input())

a = S[K-1]
S_ = [i for i in S]
for i in range(N):
    if S[i] != a:
        S_[i] = "*"
print(*S_, sep="")

Solution (Python):
N=int(input())
S=input()
K=int(input())
ans=""
for i in range(N):
    if S[i]!=S[K-1]:
        ans+="*"
    else:
        ans+=S[i]
print(ans)

Solution (Python):
n = int(input())
s = input()
m = int(input())
print(*['*' if x != s[m-1] else x for x in s], sep='')

Solution (Python):
N = int(input())
S = input()
K = int(input())
KC = S[K-1]
ans = ''
for s in S:
    if s == KC:
        ans += KC
    else:
        ans += '*'
print(ans)

Solution (Python):
N = int(input())
S = str(input())
S = list(S)
K = int(input())


for i in range(N):
      if S[i] != S[K-1]:
            S[i] = '*' 

print(''.join(S))

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
s = readline().rstrip().decode('utf-8')
k = int(readline())

res = s[k-1]
ans = ""
for i in s:
    if i == res:
        ans += i
    else:
        ans += "*"
print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())

for i in range(n):
    if s[i] == s[k-1]:
        print(s[k-1], end='')
    else:
        print('*', end='')

Solution (Python):
n=int(input())
s=str(input())
k=int(input())
s=list(s)
for i in range(0,len(s)):
  if s[i]!=s[k-1]:
    s[i]="*"
print("".join(map(str, s)))

Solution (Python):
n = int(input())
S = input()
k = int(input())
func = lambda x : x if x == S[k-1] else "*"
print(*[func(s) for s in S],sep="")

Solution (Python):
n = int(input())
s = input()
k = int(input())
for i in range(n):
  if s[i] != s[k-1]:
    s = s.replace(s[i], '*')
print(s)

Solution (Python):
n=int(input())
s=input()
k=int(input())
for i in range(n):
    if s[i] == s[k-1]:
        print(s[i],end="")
    else:
        print("*",end="")

Solution (Python):
N = input()
S = input()
k = int(input())

for s in S: print(s if s == S[k-1] else "*", end="")

Solution (Python):
n = int(input())
s = input()
k = int(input()) - 1
s_ = s[k]
print("".join([si if si == s_ else "*" for si in s]))

Solution (Python):
n = int(input())
s = input()
i = int(input())
print(*[a if a == s[i-1] else '*' for a in s], sep='')

Solution (Python):
n=int(input())
s=input()
k=int(input())
ch = s[k-1]
ans = ''
for i in range(n):
    if s[i] == ch:
        ans += ch
    else:
        ans += '*'
print(ans)

Solution (Python):
n = int(input())
s = list(input())
k = int(input())

for i in range(n):
    if(s[i] != s[k-1]):s[i] = '*'
print(''.join(s))

Solution (Python):
a,s,k = list(input() for _ in range(3))
S = s[int(k)-1]
ans = ""
for v in s:
    if v != S: ans += "*"
    else: ans += v
print(ans)

Solution (Python):
n = int(input())
s = input() 
k = int(input())

tt = s[k-1]

ans = []
for i in range(n):
    if s[i]!=tt:
        ans.append('*')
    else:
        ans.append(tt)

print(*ans,sep='')

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

def resolve():
    n=int(input())
    s=list(input())
    k=int(input())
    for i in range(n):
        if s[i]!=s[k-1]:
            s[i]='*'
    print(''.join(s))
resolve()

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

def resolve():
    n=int(input())
    s=list(input())
    k=int(input())
    l=['*']*n
    for i in range(n):
        if s[i]==s[k-1]:
            l[i]=s[k-1]
    print(''.join(l))
resolve()

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

def resolve():
    n=int(input())
    s=input()
    k=int(input())
    l=[]
    for i in range(n):
        if s[i]==s[k-1]:
            l.append(s[k-1])
        else:
            l.append('*')
    print(''.join(l))
resolve()

Solution (Python):
n = int(input())
s = input()
k = int(input())

c = s[k-1]

res = [ch if ch==c else '*' for ch in s]

print(''.join(res))

Solution (Python):
input()
S = input()
k = int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
n=int(input())
s=input()
k=int(input())
for i in range(n):
    if s[i] != s[k - 1]:
        s=s.replace(s[i],'*')
print(s)

Solution (Python):
N=int(input())
S=list(input())
K=int(input())

for i in range(len(S)):
  if S[i]!=S[K-1]:
    S[i]="*"
print(*S,sep="")

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    n=int(input())
    s=list(input())
    k=int(input())
    val=s[k-1]
    for i in range(n):
        if s[i]!=val:
            s[i]='*'
    print(''.join(s))


resolve()

Solution (Python):
n = int(input())
s = list(input())
k = int(input())
for i in range(n):
  if s[i] != s[k-1]:
    s[i] = "*"
ans = "".join(s)
print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())-1
res = ''
for i in range(n):
  if s[i] == s[k]:
    res += s[i]
  else:
    res += '*'
print(res)

Solution (Python):
N=int(input())
S=input()
K=int(input())
for s in S:
    print(s if s==S[K-1] else "*",end="")

Solution (Python):
N=int(input())
S=input()
K=int(input())
T=""
s=S[K-1]
for i in S:
    if i!=s:
        T+="*"
    else:
        T+=s
print(T)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = int(input())
    s = list(input())
    k = int(input())

    for i in range(n):
        if s[i] != s[k - 1]:
            s[i] = "*"

    print("".join(s))


if __name__ == '__main__':
    resolve()

Solution (Python):
N = int(input())
S = input()
S = list(S)
K = int(input())

s = S[K-1]
for i in range(N):
    if S[i] != s:
        S[i] = "*"

S = "".join(S)
print(S)

Solution (Python):
n = int(input())
s = input()
l = s[int(input())-1]

ans = ""
for i in range(n):
    if s[i] != l:
        ans +="*"
    else:
        ans +=l
print(ans)

Solution (Python):
n = int(input())
S = input()
k = int(input())

for s in S:
    print(s if s==S[k-1] else "*", end="")

Solution (Python):
n = int(input())
s = input()
k = int(input())
t = s[k-1]
ans = ""
for c in s:
    if c==t:
        ans += c
    else:
        ans += '*'
else:
    print(ans)

Solution (Python):
n, s, k = open(0)
j = s[int(k)-1]
print("".join(["*",j][i==j] for i in s)[:-1])

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    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
    

    
    

    n = int(input())
    s = list(input().rstrip())
    k = int(input())
    a = s[k-1]
    for i in range(n):
        if s[i] == a:
            continue
        s[i] = '*'
    print(*s, sep='')

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input()
K = int(input())
not_error = S[K - 1]
print(*[s if s == not_error else "*" for s in S], sep="")

Solution (Python):


if False:
    N,K=map(int,input().split())
    print('YES' if N-K-(K-1)>=0 else 'NO')



if False:
    N=int(input())
    S=input()
    print('Yes' if S.count('R')>S.count('B') else 'No')



if False:
    print('Yes' if len(set(input().split()))==1 else 'No')



if True:
    N=int(input())
    S=input()
    K=int(input())
    r=S[K-1]
    ans=''
    for s in S:
        if s==r: ans+=s
        else: ans+='*'
    print(ans)

Solution (Python):
N = int(input())
S = list(input())
K = int(input())

cha = S[K-1]
for i in range(len(S)):
    if S[i] != cha:
        S[i] = "*"

print("".join(S))

Solution (Python):
length= int(input())
moji = str(input())
num = int(input())
set = moji[num-1]
ans = ""
for i in range(length):
  if moji[i] != set:
    ans += "*"
  else:
    ans += moji[i]
print(ans)

Solution (Python):
N = int(input())
S = list(input())
K = int(input())

c = S[K-1]

for i in range(N):
    if S[i] != c:
        S[i] = '*'

print(''.join(S))

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    s=input()
    k=int(input())
    ans=""
    sx=s[k-1]
    for ss in s:
        if ss!=sx:
            ans+='*'
        else:
            ans+=sx 
    print(ans)

if __name__=='__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    s=input()
    k=int(input())
    ans=""
    sx=s[k-1]
    for ss in s:
        if ss!=sx:
            ans+='*'
        else:
            ans+=sx 
    print(ans)

if __name__=='__main__':
    main()

Solution (Python):
n = int(input())
s = list(input())
k = int(input()) - 1
for i in range(n):
    if s[i] != s[k]:
        s[i] = "*"
print("".join(s))

Solution (Python):
a = int(input())
b = input()

c = b[int(input()) - 1]

s = [b[i] if b[i] == c else '*' for i in range(a)]

print(''.join(s))

Solution (Python):
N = int(input())
S = list(str(input()))
K = int(input())
for i in range(0, N):
    if S[i] != S[K-1]:
        S[i] = '*'
print(*S, sep='')

Solution (Python):
n = int(input())
s = list(input())
k = int(input())
for i in range(n):
    if s[k - 1] != s[i]:
        s[i] = "*"
print("".join(s))

Solution (Python):
N = int(input())
S = input()
K = int(input())
a = ""
b = S[K - 1]
for i in range(N):
  a = S[i]
  if (a == b):
    print(a,end = "")
  else:
    print("*",end = "")

Solution (Python):
N = int(input())
S = input()
K = int(input())
for i in range(N):
    if S[i] != S[K-1]:
        S = S[:i] + '*' + S[(i+1):]
print(S)

Solution (Python):
N = int(input())
S = input()
K = int(input())
ans = ""
for i in S:
  if i != S[K - 1]: ans += "*"
  else: ans += S[K - 1]  
print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())
string = s[k-1]
res = ""
for i in range(n):
    if s[i] != string:
        res += "*"
    else:
        res += string
print(res)

Solution (Python):
input()
S = input()
K = int(input())
for i in S:
  print(i if i == S[K-1] else "*",end="")

Solution (Python):
n = int(input())
s = list(map(str,input()))
k = int(input())

a = s[k-1]

for i in range(n):
    if s[i]==a:
        continue
    else:
        s[i] = "*"

print("".join(s))

Solution (Python):
n = int(input())
s = input()
k = int(input())

c = s[k-1]
ans = ""
for e in s:
    if e == c:
        ans += e
    else:
        ans += "*"

print(ans)

Solution (Python):

def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n = ii()
s = list(input())
k = ii()
for i in range(len(s)):
    if s[i] != s[k-1]:
        s[i] = '*'
print(''.join(s))

Solution (Python):
N=int(input())
S=list(input())
K=int(input())
k=S[K-1]
for i in range(N):
    if S[i]!=k:
        S[i]="*"
print(*S,sep="")

Solution (Python):
n = int(input())
s = input()
k = int(input()) -1
d = s[k]
w = []
for i in range(n):
    if s[i] != d:
        w.append('*')
    else:
        w.append(d)
print(*w, sep='')

Solution (Python):
n = int(input())
s = input()
k = int(input())

char = s[k-1]

ret_list = []

for i in range(len(s)):
    if s[i] == char:
        ret_list.append(s[i])
    else:
        ret_list.append('*')

print("".join(ret_list))

Solution (Python):
N = input()
S = input()
K = int(input())
for s in S: print(s if s==S[K-1] else "*", end="")

Solution (Python):
n=int(input())
s=input()
k=int(input())
r=s[k-1]
ans=""
for i in range(n):
  if s[i]==r:
    ans+=r
  else:
    ans+="*"
print(ans)

Solution (Python):
def main():
    N = int(input())
    s = list(input())
    K = int(input())
    
    base = s[K-1]
    for i in range(N):
        if s[i] != base:
            s[i] = "*"
            
    print(*s,sep="")
    
if __name__ == "__main__":
    main()

Solution (Python):
def main(n: int, s: str, k: int):
    rp = s[k - 1]

    for s in s:
        if s != rp:
            print("*", end="")
        else:
            print(rp, end="")


if __name__ == "__main__":
    n = int(input())
    s = input()
    k = int(input())

    main(n, s, k)

Solution (Python):
from re import sub

n = int(input())
s = input()
k = int(input())

print(sub('[^{}]'.format(s[k-1]), '*', s))

Solution (Python):
n = int(input())
s = list(input())
a = int(input())
b = s[a-1]
A = []
for i in s:
    if i != b:
        A.append("*")
    else:
        A.append(i)
print("".join(A))

Solution (Python):
input()
S=input()
K=int(input())
for s in S:
  print(s if s==S[K-1] else '*',end='')

Solution (Python):
N = int(input())
S = list(input())
K = int(input())
for i in range(len(S)):
    if S[i] != S[K-1]: S[i] = '*'
print(''.join(S))

Solution (Python):

n = int(input())
s = list(input())
k = int(input())

a = s[k-1]

for i in range(n):
    if s[i] != a:
        s[i] = "*"
print("".join(s))

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

n = int(input())
s = input().rstrip("\r\n")
k = int(input())
ans = ''
for c in s:
    if c != s[k-1]:
        ans += '*'
        continue
    ans += c
print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())
for i in range(n):
  if s[i] != s[k-1]:
    s = s.replace(s[i], '*')
print(s)

Solution (Python):
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')

N = I()
S = input()
K = I()

c1 = S[K - 1]
for c in S:
    print(c if c == c1 else '*', end='')
print()

Solution (Python):
def main():
    length = int(input())
    string = list(input())
    index = int(input())
    not_replace = string[index - 1]
    for i in range(length):
        if string[i] != not_replace:
            string[i] = "*"
    print("".join(string))


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
s=list(input())
k=int(input())
tmp = s[k-1]
res = ["0"]*n
for i in range(n):
    if s[i] != tmp:
        res[i] = "*"
    else:
        res[i] = tmp
print(*res, sep="")

Solution (Python):
N = int(input())
S = input()
K = int(input())

ch = S[K-1]

r = ''
for si in S:
    if si == ch:
        r += si
    else:
        r += '*'

print(r)

Solution (Python):
def main():
    n = int(input())
    s = input().rstrip()
    k = int(input())
    c = s[k-1]
    for i in range(n):
        if s[i] != c:
            print("*", end="")
        else:
            print(s[i], end="")

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
s = list(input())
k = int(input())
ans = ''
for i in range(n):
    if s[i] != s[k-1]:
        s[i] = '*'
    else:
        continue
print(*s, sep='')

Solution (Python):
n=int(input())
s=list(input())
k=s[int(input())-1]
for i in range(n):
    if s[i]!=k:
        s[i]="*"
print(*s,sep="")

Solution (Python):
input()
S = input()
k = int(input())
for s in S:print(s if s == S[k-1] else "*",end="")

Solution (Python):
n = int(input())
s = str(input())
k = int(input())
for i in range(n):
    if(s[i] == s[k-1]):
        print(s[i],end="")
    else:
        print("*",end="")

Solution (Python):
n=int(input())
s=list(input())
S=s[int(input())-1]
for i in range(n):
    if s[i]!=S:
        s[i]="*"
print("".join(s))

Solution (Python):
n = int(input())
s = input()
k = int(input())

for a in s:
    print(a if a==s[k-1] else '*',end='')

Solution (Python):
n=int(input())
s=list(input())
k=int(input())
for i in range(n):
    if s[i] != s[k-1]:
        s[i] = "*"
print("".join(s))

Solution (Python):
n = int(input())
s = input()
k = int(input())
l = []
for i in s:
  if i == s[k - 1]:
    l.append(s[k - 1])
  else:
    l.append("*")
print(*l, sep="")

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
N = int(input())
S = input()
K = int(input())

ans =''
for i in range(N):
  if S[i] == S[K-1]:
    ans += S[i]
  else:
    ans += '*'

print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())
for i in s:
    if i != s[k - 1]:
        s = s.replace(i, '*')
print(s)

Solution (Python):
n=int(input())
s=input()
k=int(input())
a=''
for i in range(n):
    if s[i] != s[k-1]:
        a+='*'
    else:
        a+=s[i]
print(a)

Solution (Python):
N=int(input())
S=input()
K=int(input())
c=S[K-1]
s=""
for i in range(N):
    if S[i]!=c:
        s="".join((s,"*"))
    else:
        s = "".join((s, S[i]))
print(s)

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
n = int(input())
s = input()
k = int(input())
c = s[k-1]
ans = ''
for i in range(n):
    if s[i] == c:
        ans += c
    else:
        ans += '*'
print(ans)

Solution (Python):
N = int(input())
s = input()
p = int(input())
sl = list(s)
c = sl[p-1]
sp = map(lambda x:"*" if x != c else x, sl)
print("".join(sp))

Solution (Python):
import sys
import os


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

    N = int(sys.stdin.readline().rstrip())
    S = str(sys.stdin.readline().rstrip())
    K = int(sys.stdin.readline().rstrip())
    target = S[K-1]

    for i in range(N):
        if S[i] != target:
            print("*", end="")
        else:
            print(target, end="")


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input()
K = int(input())
print("".join([i if i==S[K-1] else "*" for i in S]))

Solution (Python):
n = int(input())
s = input()
k = int(input())

t = s[k-1]
ans = ''
for i in range(len(s)):
    if s[i] == t:
        ans += s[i]
    else:
        ans += '*'
print(ans)

Solution (Python):
N=int(input())
S=input()
K=int(input())
print("".join(s if s==S[K-1] else "*" for s in S))

Solution (Python):
N=int(input())
S=list(input())
ks=S[int(input())-1]
for i in range(N):
  if S[i]!=ks:
    S[i]='*'
print(''.join(S))

Solution (Python):


N = int(input())
S = str(input())
K =int(input())

K_char = S[K-1]
ans = ''
for i in S:
    if i == K_char:
        ans += i
    elif  i != K_char:
        ans += '*'
        
print(ans)

Solution (Python):



N = int(input().strip())
S = input().strip()
K = int(input().strip())

new_S=""
for word in S:
    if word != S[K-1]:
        new_S += "*"
    else:
        new_S += word

print(new_S)

Solution (Python):
N=int(input())
S=input()
K=int(input())
print(''.join(s if s == S[K-1] else '*'for s in S ))

Solution (Python):
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)


def dump_impl(*objects):
    print(*objects, file=sys.stderr)


def dump_dummy(*objects):
    pass


dump = dump_impl if "DEBUG" in sys.argv else dump_dummy

N = int(input())
S = input()
K = int(input())
ans = []
SK = S[K-1]
for si in S:
    ans.append(si if si == SK else '*')
print(''.join(ans))

Solution (Python):
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)


def dump_impl(*objects):
    print(*objects, file=sys.stderr)


def dump_dummy(*objects):
    pass


dump = dump_impl if "DEBUG" in sys.argv else dump_dummy

N = int(input())
S = input()
K = int(input())
ans = []
SK = S[K-1]
for si in S:
    ans.append(si if si == SK else '*')
print(''.join(ans))

Solution (Python):
N = int(input())
S = input()
K = int(input())
ans = ""

for i in range(N):
    if(S[K-1] != S[i]):
        ans += "*"
    else:
        ans += S[K-1]
print(ans)

Solution (Python):
N=int(input())
S=list(input())
K=int(input())
for i in range(N):
  if S[i]!=S[K-1]:
    S[i]="*"
  
print(*S,sep="")

Solution (Python):
input()
S =input()
k = int(input())
for s in S:print(s if s==S[k-1] else "*",end ="")

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
n = int(input())
s = input()
k = int(input())

moji = s[k - 1]

ans = ''

for i in range(n):
	if s[i] == moji:
		ans += s[i]
	else:
		ans += '*'

print(ans)

Solution (Python):
n = int(input())
s = input()
k = int(input())

target = s[k-1]

for i in range(len(s)):
  if target != s[i]:
    s = s[:i] + "*" + s[i+1:]
    
print(s)

Solution (Python):
N = int(input())
S = list(input())
K = int(input())
a = S[K-1]
for i in range(N):
    if S[i]!=a:
        S[i] = '*'
print(*S,sep='')

Solution (Python):
n=int(input())
s=input()
k=int(input())
ans=""
for i in range(n):
    if s[i]!=s[k-1]:
        ans+="*"
    else:
        ans+=s[i]
print(ans)

Solution (Python):
N = int(input())
s = input()
index = int(input())

for i in range(N):
  if not s[i] == s[index - 1]:
    s = s[0:i] + '*' + s[i + 1:]
print(s)

Solution (Python):
input()
S=input()
k=int(input())
for s in S:print(s if s==S[k-1] else "*",end="")

Solution (Python):
n=int(input())
s=list(input())
k=int(input())

char=s[k-1]
for i in range(n):
  if s[i]!=char:
    s[i]='*'
print(''.join(s))