Problem:
 Score : 200 points    Problem Statement You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.      Constraints  2 ≤ |S| ≤ 26 , where |S| denotes the length of S .  S consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  S       Output If all the characters in S are different, print yes (case-sensitive); otherwise, print no .        Sample Input 1 uncopyrightable      Sample Output 1 yes       Sample Input 2 different      Sample Output 2 no       Sample Input 3 no      Sample Output 3 yes

Solution (Python):
s=list(input())
a={}
ans='yes'
for i in s:
    a[i]=a.get(i,0)+1
    if a[i]>1:
        ans='no'
        break
print(ans)

Solution (Python):
s=list(input())
a=[0]*26
ans='yes'
for i in s:
    a[ord(i)-97]+=1
    if a[ord(i)-97]>1:
        ans='no'
        break
print(ans)

Solution (Python):
S=list(input())
s=set(S)
if len(s)==len(S):
    print('yes')
else:
    print('no')

Solution (Python):

S=input()

if len(S)==len(set(S)):
  print('yes')
else:
  print('no')

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

s = input().rstrip()
print("yes" if len(set(s)) == len(s) else "no")

Solution (Python):
s=list(input());print("yneos"[len(s)>len(set(s))::2])

Solution (Python):
s=input()

k=list(s)
m=list(set(s))

if len(k)==len(m):
  print("yes")
else:
  print("no")

Solution (Python):
from collections import Counter
s=list(str(input()))
c=Counter(s)
print("yneos"[len(c)!=len(s)::2])

Solution (Python):
s = input()
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):
s = list(input())
if len(s) == len(set(s)):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
for i in range(len(s)):
    if s.count(s[i])>1:
        print('no')
        exit()
print('yes')

Solution (Python):
S = input()
c = set()
for s in S:
    if s in c:
        print("no")
        break
    c.add(s)
else:
    print("yes")

Solution (Python):
s=list(input())
if len(s)==len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
s = str(input())
if len(s) == len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
from collections import Counter

S = list(input())

c = Counter(S)

for i in c.most_common():
    if i[1] > 1:
        print("no")
        exit()

print("yes")

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

if len(x) == len(s):
  print("yes")
else:
  print("no")

Solution (Python):
S = str(input())
se = {S[i] for i in range(len(S))}
if len(se) == len(S):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print('no' if len(s) > len(set(s)) else 'yes')

Solution (Python):
s=input()
f=True
for a in s:
    if s.count(a)>1:
        f=False
        break
print('yes' if f else 'no')

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

for i in range(len(s)):
    prev = i - 1
    if s[prev] == s[i]:
        print('no')
        break
else:
    print('yes')

Solution (Python):
S = input()
di = {}
flag = True
for i in S:
  if(i in di):
    flag = False
    break
  else:
    di[i] = 1
if(flag):
  print('yes')
else:
  print('no')

Solution (Python):
s=input();print('yneos'[len(set(s))!=len(s)::2])

Solution (Python):
S = input()
print("yes" if (len(set(S)) == len(S)) else "no")

Solution (Python):

s = list(input())
s1 = list(set(s))
if len(s1) == len(s):
    print("yes")
else:
    print("no")

Solution (Python):

S = input()
all_dif = True
for i in range(len(S)):
    if i == len(S)-1:
        break
    for j in range(1,len(S)-i):
        if S[i] == S[i+j]:
            all_dif = False
if all_dif:
    print("yes")
else:
    print("no")

Solution (Python):
s = list(input())
ss = list(set(s))
print('yes' if len(s) == len(ss) else 'no')

Solution (Python):
s = input()

mem = set()

ans = 'yes'

for i in s:
    if i in mem:
        ans = 'no'
        break
    else:
        mem.add(i)

print(ans)

Solution (Python):

def solve(s):
  for c in s:
    if s.count(c) > 1:
      return False
  return True


if __name__ == "__main__":
  s = str(input())
  if solve(s):
    print('yes')
  else:
    print('no')

Solution (Python):
S = input()
d = set()

for s in S:
    d.add(s)

if len(S) == len(d):
    print('yes')
else:
    print('no')

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math

mod = 10**9+7



S = str(input())
used = []
for i in range(len(S)):
    if S[i] in used:
        print("no")
        exit()
    else:
        used.append(S[i])
print("yes")

Solution (Python):
s = sorted(list(input()))
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print("no")
        exit()
print('yes')

Solution (Python):

s = input()
print("yes" if len(s) == len(set(s)) else "no")

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

if len(x)==len(s):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
print('yes' if len(list(s)) == len(set(s)) else 'no')

Solution (Python):
import sys
from collections import Counter

s_cnt = Counter(input())

for i in s_cnt.values():
    if i != 1:
        print('no')
        sys.exit()

print('yes')

Solution (Python):

def read_input():
    s = input()
    return s

def submit():
    s = read_input()
    char_occurs = {}

    for c in s:
        if c in char_occurs.keys():
            print('no')
            return
        else:
            char_occurs[c] = 1

    print('yes')

if __name__ == '__main__':
    submit()

Solution (Python):
S = input()
l = [ i for i in S ]

if len(list(set(l))) == len(l):
  print("yes")
else:
  print("no")

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):
S = list(input())
S2 = set(S)
print("yes" if len(S)==len(S2) else "no")

Solution (Python):
s=input()
print('no'if len(set(s))<len(s)else'yes')

Solution (Python):
S = input()
if len(set(S)) == len(S):
	print("yes")
else:
	print("no")

Solution (Python):
S = input()
if len(S) == len(list(set(S))):
  print('yes')
else:
  print('no')

Solution (Python):
S = list(str(input()))
set_S = set(S)
if len(S) == len(set_S):
        print("yes")
else:
        print("no")

Solution (Python):
S = input()
st = set()
for c in S:
    st.add(c)
if len(S) == len(st):
    print("yes")
else:
    print("no")

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()
    if len(s)==len(set(s)):
        print('yes')
    else:
        print('no')

solve()

Solution (Python):
S = input()
check = [0] * 26

for i in S:
    j = ord(i) - ord('a')
    check[j] += 1

ans = 'yes'
for i in check:
    if i > 1:
        ans = 'no'
    
print(ans)

Solution (Python):
S = input()
check = []
flg = 0
for i in S:
    if i not in check:
        check.append(i)
    else:
        flg = 1
        break

print('no' if flg else 'yes')

Solution (Python):
s=input();print('yneos'[len(s)>len(set(s))::2])

Solution (Python):
S = input()
print('yes' if len(S) == len(set(S)) else 'no')

Solution (Python):
l=[]
for i in input():
    if i in l:
        print("no")
        break
    else:
        l.append(i)
else:
    print("yes")

Solution (Python):
s = input()

if len(set(s)) == len(s):
    print('yes')
else:
    print('no')

Solution (Python):
s=input()
a=set()
for i in range(len(s)):
  a.add(s[i])
if len(a)==len(s):
  ans='yes'
else:
  ans='no'
print(ans)

Solution (Python):
s = input()
a = []
flag = True
for i in range(len(s)):
    if s[i] in a:
        flag = False
    a.append(s[i])
if flag:
    print("yes")
else:
    print("no")

Solution (Python):

s=list(input())
x=set(s)

if len(x)==len(s):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
l=list(s)
ls=list(set(l))
print(["no","yes"][len(l)==len(ls)])

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

if len(s) == len(set(s)):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
ss=set(s)
ans='no'
if len(s)==len(ss):
    ans='yes'
print(ans)

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    INF = float("inf")
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    S = list(_ for _ in input())
    ans = 'yes'
    for s in S:
        if ''.join(S).count(s)>1:
            ans = 'no'
            break
    print(ans)
    
if __name__ == '__main__':
    main()

Solution (Python):
s=input()
l=len(s)
arr=[0]*26
alpha=list('abcdefghijklmnopqrstuvwxyz')
for i in range(l):
  for j in range(26):
    if s[i]==alpha[j]:
      arr[j]+=1
for i in range(26):
  if arr[i]>1:
    print('no')
    break
  if i==25:
    print('yes')

Solution (Python):
s=list(input())
a=0
for j in range(len(s)):
    for i in range(len(s)):
        if s[j]==s[i]:
            a=a+1
        else:
            pass
if a==len(s):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
count = [0] * 26

for c in s:
    count[ord(c)-97] += 1
for num in count:
    if num > 1:
        print("no")
        exit()
print("yes")

Solution (Python):
S = input()
s = set(S)
if len(S) == len(s):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
S=[]
for i in range(len(s)):
  S.append(s[i])
print("yes" if len(set(S))==len(s) else "no")

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s=input()
if len(s)==len(set(list(s))):
  print('yes')
else:
  print('no')

Solution (Python):
s=input()
print("no" if len(s)-len(set(s))  else "yes")

Solution (Python):
a=input()
b=[0]*26
for c in a:
    b[ord(c)-97] += 1
for i in b:
    if i >= 2:
        print("no")
        exit()
print("yes")

Solution (Python):
s = input()
print("yneos"[len(s)!=len(set(s))::2])

Solution (Python):
S = input()
print(["yes", "no"][not(len(S) == len(set(S)))])

Solution (Python):
S = input()

ans = "yes"
for i in range(len(S)):
	if S.count(S[i:i+1]) > 1:
		ans = "no"
		break

print(ans)

Solution (Python):
import collections
s = input()
c = collections.Counter(s)
if c.most_common(1)[0][1] != 1:
    print('no')
else:
    print('yes')

Solution (Python):
S = list(input())
T = []
for i in S:
    if (i in T):
        print("no")
        exit()
    T.append(i)
print("yes")

Solution (Python):
s=input()
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):
s = input()
t = set(s)
if len(s) == len(t):
    print("yes")
else:
    print("no")

Solution (Python):
s = str(raw_input())
if len(s) == len(set(s)):
	print 'yes'
else:
	print 'no'

Solution (Python):
S=input();print('yneos'[len(S)!=len(set(list(S)))::2])

Solution (Python):
S = input()

length = len(S)
set_length = len(set(S))

if length == set_length:
    print('yes')
else:
    print('no')

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    S = input().strip()

    n = len(S)
    m = len(set(S))

    if n == m:
        return 'yes'
    else:
        return 'no'


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

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

if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = list(input())
if len(set(s)) == len(s):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()

print("yes" if len(s) == len(set(s)) else "no")

Solution (Python):
s=input();print('yneos'[len(s)!=len(set(s))::2])

Solution (Python):
S = input()
if len(S) == len(set(list(S))):
    print("yes")
else:
    print("no")

Solution (Python):
import  collections
dic=collections.Counter(list(input()))
if max((dic.values()))==1:
	print('yes')
else:print('no')

Solution (Python):
hoge=list(input())
hoge.sort()
ans="yes"
for i in range(len(hoge)-1):
  if(hoge[i]==hoge[i+1]):
    ans="no"
    
print(ans)

Solution (Python):
s = list(input())
t = set(s)
if len(s) == len(t):
	print('yes')
else:
	print('no')

Solution (Python):


s = list(input())

s.sort()

answer = True

for i in range(1,len(s)):
    if s[i] == s[i-1]:
        answer = False

if answer:
    print("yes")
else:
    print("no")

Solution (Python):


S = input()
s = set(S)
print('yes' if len(S) == len(s) else 'no')

Solution (Python):



S = input()
l = []
for i in S:
    if i not in l:
        l.append(i)
print('yes' if len(S) == len(l) else 'no')

Solution (Python):
import collections
s = list(input())
s_ = set(s)
if len(s) == len(s_):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
a=set()
ans="yes"
for i in range(len(s)):
  if s[i] in a:
    ans="no"
    break
  a.add(s[i])
print(ans)

Solution (Python):
S = list(input())
set_S = set(S)
print('yes' if len(S)==len(set_S) else 'no')

Solution (Python):

from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


"""
a,b = LI()
if a+b >= 10:
    print("error")
else:
    print(a+b)
"""

s = S()
d = defaultdict(int)
for i in s:
    if d[i]:
        print("no")
        quit()
    d[i] = 1
print("yes")

"""
n = I()
s = IR(n)
su = sum(s)
dp = [[0 for i in range(su+1)] for j in range(n)]
dp[0][s[0]] = 1
for i in range(n):
    dp[i][0] = 1
for i in range(1,n):
    for j in range(su+1)[::-1]:
        if s[i]+j <= su:
            dp[i][s[i]+j] = max(dp[i][s[i]+j],dp[i-1][j])
        dp[i][j] = max(dp[i][j],dp[i-1][j])
for i in range(su+1)[::-1]:
    if dp[n-1][i] == 1 and i%10 != 0:
        break
print(i)
"""


"""
n,a,b = LI()
h = IR(n)
l = 0
r = math.ceil(max(h)/b)
while r-l > 1:
    m = (l+r)//2
    k = 0
    for i in range(n):
        k += max(0,math.ceil((h[i]-b*m)/(a-b)))
        if k > m:break
    if k > m:
        l = m
    else:
        r = m
print(r)
"""

Solution (Python):
S = input()
if len(set(S)) == len(S):
    print('yes')
else:
    print('no')

Solution (Python):
import collections

s=input()

S=collections.Counter(s)
ans='yes'
for v in S.values():
    if v!=1:
        ans='no'
        break
print(ans)

Solution (Python):
def varied(S: str)->bool:
    d = {}
    for c in S:
        if c in d:
            return False
        d[c] = True
    return True


if __name__ == "__main__":
    S = input()
    yes = varied(S)
    print('yes' if yes else 'no')

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

for c in s:
    if s.count(c) > 1:
        print('no')
        break
else:
    print('yes')

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

memo = set(S)
if len(S) == len(memo):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
a = 0
for i in range(len(s)):
  a = a + s.count(s[i])
if a == len(s):
  print("yes")
else:
  print("no")

Solution (Python):
s=input();print('yneos'[len(set(s))!=len(s)::2])

Solution (Python):

import collections
S = input()
if len(S) ==len(collections.Counter(S)):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
s1=set(s)
if len(s)==len(s1):
  print("yes")
else:
  print("no")

Solution (Python):
S = input()
s = list(S)
l = []
for i in s:
    if i not in l:
        l.append(i)
print('yes' if len(S) == len(l) else 'no')

Solution (Python):
S = input()

l = ''
for i in S:
    if i not in l:
        l += i

print('yes' if S == l else 'no')

Solution (Python):
S = str(input())
if len(S) == len(set(S)):
    print('yes')
else:
    print("no")

Solution (Python):
s,a=input(),[]
x,ans=len(s),"yes"
for i in range(x):a.append(s[i])
a.sort()
for i in range(x-1):
  if a[i]==a[i+1]:ans="no"
print(ans)

Solution (Python):
s=list(input())
if len(set(s))==len(s):
  print('yes')
else:
  print('no')

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

if len(S) == len(SS):
    print('yes')
else:
    print('no')

Solution (Python):
import sys
S = input()
for i in range(len(S)):
  if S[i] in S[0:i] or S[i] in S[i+1:len(S)+1]:
    print("no")
    sys.exit()
print("yes")

Solution (Python):
S = list(input())
print('yes' if len(list(set(S))) == len(S) else 'no')

Solution (Python):
s=input()
for i in range(len(s)):
    x=-1
    for j in range(len(s)):
        if s[i]==s[j]:
            x+=1
    if x!=0:
        print("no")
        exit()
print("yes")

Solution (Python):
i = input()
s = {c for c in i}
if len(i) == len(s):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
l_s = list(s)
c = 0
for i in range(len(s)):
	if l_s.count(s[i]) != 1:
		c += 1
		print('no')
		break        
        
if c == 0:
	print('yes')

Solution (Python):
S = input()
print('yes' if len(S) == len(set(list(S))) else 'no')

Solution (Python):
s=input()
res='yes'
for i in range(len(s)):
    if s.count(s[i])>1:
        res='no'
print(res)

Solution (Python):
S=input()
k=len(S)
c=0
for i in range(k):
    for j in range(k-i):
        if S[i]!=S[i+j]:
            c+=1
if c==k*(k-1)/2:
    print('yes')
else:
    print('no')

Solution (Python):
S = [i for i in input()]
advance = len(S)
if advance == len(set(S)):
    print("yes")
else:
    print("no")

Solution (Python):
S = input()

count = []
for i in S:
    if i in count:
        print('no')
        exit()
    count.append(i)

print('yes')

Solution (Python):
S = input()
s = set(S)
print('yes ' if (len(S) == len(s)) else 'no')

Solution (Python):
s = list(input())
a = len(s)
b = len(list(set(s)))
if a == b:
    print('yes')
else:
    print('no')

Solution (Python):
S = input()

if (len(S) == len(set(S))):
    print("yes")
else:
    print("no")

Solution (Python):
S=input()
print('yes') if len(S)==len(list(set(S))) else print('no')

Solution (Python):
s = input()

b = []
for x in s:
    if x in b:
        print("no")
        exit()
    b.append(x)

print("yes")

Solution (Python):
s=input()
from collections import Counter
c=Counter(s)
if c.most_common()[0][1]>1:
  print("no")
else:
  print("yes")

Solution (Python):
n = input()

m = list(n)


if len(set(m)) == len(m):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
if len(set(s))!=len(s):
    print("no")
else:
    print("yes")

Solution (Python):
s=input()
m=set()
for c in s:
  if c in m:
    print("no")
    quit(0)
  m.add(c)
print("yes")

Solution (Python):
S = input()
for i in range(26):
    if S.count(chr(i+ord('a'))) >= 2:
        print("no")
        import sys
        sys.exit()
print("yes")

Solution (Python):
S = input()
print("yes" if len(S) == len(set(S)) else "no")

Solution (Python):
s = list(input())
s_len = len(s)
s_set = len(set(s))
if s_len == s_set:
    print('yes')
else:
    print('no')

Solution (Python):
S = input()

o = set()
ans = True
for s in S:
    if s in o:
        ans = False
    o.add(s)

print("yes" if ans else "no")

Solution (Python):
def main():
    S = input()
    saw = set()
    for c in S:
        if c in saw:
            print("no")
            return
        saw.add(c)
    print("yes")


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print(['no','yes'][len(s)==len(set(list(s)))])

Solution (Python):
S = input()

if(len(set(S)) == len(S)):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print('yes' if len(s)==len(set(s)) else 'no')

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

if len(set(list(s))) == len(s):
    print("yes")
else:
    print("no")

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

if len(s) == len(list(set(s))):
    print('yes')
else:
    print('no')

Solution (Python):
s=input()
ans=[]
judge=1
for i in s:
    if i not in ans:ans.append(i)
    else:judge=0
print("yes") if judge else print("no")

Solution (Python):
""" AtCoder """

S = input()

T = set(S)

if len(S) == len(T):
    print("yes")
else:
    print("no")

Solution (Python):
s=[i for i in input()]
print("yes" if len(list(set(s)))==len(s) else "no")

Solution (Python):
S = list(input())
len1 = len(S)
S = set(S)
S = list(S)
len2 = len(S)

if(len1 == len2):
  print('yes')
else:
  print('no')

Solution (Python):
S = list(input())
S.sort()
for i in range(1,len(S),1):
  if S[i-1] == S[i]:
    print("no")
    break
  elif i == len(S)-1:
    print("yes")
    break

Solution (Python):

S=input()
W=set(S)
if len(S)==len(W):
  print("yes")
else:
  print("no")

Solution (Python):
s = input()
print('yes' if len(s)==len(set(s)) else 'no')

Solution (Python):

S = list(input())
print(['no', 'yes'][len(S)==len(set(S))])

Solution (Python):
s = list(input())
s.sort()
flag = True
for i in range(len(s) - 1):
    if s[i] == s[i + 1]:
        flag = False

if flag:
    print("yes")
else:
    print("no")

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("yes")
    else:print("no")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())







a = input()                                  






b = set()
for i in range(len(a)):
    b.add(a[i])
if len(b) == len(a):
    j(1)
j(0)

Solution (Python):
l=list(input())
l.sort()
flag = False
for i in range(len(l)-1):
    if l[i]==l[i+1]:
        flag = True 

if flag:
    print("no")
else:
    print("yes")

Solution (Python):
s=list(input())
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):
def main():
    s = input()
    past = []
    for x in s:
        if x not in past:
            past.append(x)
        else:
            print('no')
            return
    print('yes')

main()

Solution (Python):
s = input()
x = []

for i in s:
    x.append(i)

X = set(x)

if len(x) == len(X):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
print('yes' if len(s)==len(set(s)) else 'no')

Solution (Python):
S=input()
print('yes' if len(S)==len(set(S)) else 'no')

Solution (Python):
s = input()
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

Solution (Python):
s = input()
li_s = list(s) 
li_ss= list(set(s)) 
 
if len(li_s)==len(li_ss):
  print("yes")
else:
  print("no")

Solution (Python):
s = list(input())
if len(s) == len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
S = input()
flag = True
for s in S:
    if S.count(s) > 1:
        flag = False
        break
if flag:
    print('yes')
else:
    print('no')

Solution (Python):
S = raw_input()

if len(S)==len(set(S)):
  print "yes"
else:
  print "no"

Solution (Python):
S = input()
for s in S:
  if(S.count(s) != 1):
    print('no')
    break
else:
  print('yes')

Solution (Python):
s=input()
w=set(s)
if len(s)==len(w):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()

if len(s) == len(set(s)):
    ans = 'yes'
else:
    ans = 'no'
print(ans)

Solution (Python):
s = input()
if len(s) == len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
S = input().rstrip()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

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

if len(s) == len(s_1):
    print("yes")
else:
    print("no")

Solution (Python):
s = str(input())
b = set(s)
if len(s) == len(b):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
if len(list(set(s)))<len(s):print("no")
else:print("yes")

Solution (Python):
S = input()
s = set(S)
print("yes" if len(S) == len(s) else "no")

Solution (Python):
S = input()
tmp = set()
for s in S:
    tmp.add(s)
if len(S) == len(tmp):
    print('yes')
else:
    print('no')

Solution (Python):
s=sorted(list(input()))
t=sorted(set(s))
print("yes"if s==t else"no")

Solution (Python):


















import collections
import math
from functools import reduce


S=input()

if len(set(S))==len(S):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
for i in range(len(s)-1):
  for j in range(i+1,len(s)):
    if s[i]==s[j]:
      print("no")
      exit()
print("yes")

Solution (Python):
S=list(input())
S.sort()
j="yes"
for i in range(1,len(S)):
  if S[i]==S[i-1]:
    j="no"
print(j)

Solution (Python):
S = [i for i in input()]
print('yes' if len(S) == len(set(S)) else 'no')

Solution (Python):
s=input()
print('yes') if len(s)==len(set(s)) else print('no')

Solution (Python):
S = raw_input()

alpha = []

flag = 'yes'
for i in S:
    if i not in alpha:
        alpha.append(i)
    else:
        flag = 'no'

print flag

Solution (Python):
S = list(input())
n1 = len(S)
n2 = len(set(S))
if n1==n2:
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
if sorted(s)==sorted(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
s = str(input())
if len(s) == len(set(s)):
  print('yes')
else:
  print('no')

Solution (Python):
s = input()

if len(s) == len(set(s)):
    print("yes")
else:
    print("no")

Solution (Python):
s = input()
print("yes" if len(s) == len(set(s)) else "no")

Solution (Python):
def func():
    pass


def main():
    s = input()
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
t = set(s)
if len(s) == len(t):
    print('yes')
else:
    print('no')

Solution (Python):
s = list(input())
print('yes' if len(set(s)) == len(s) else 'no')

Solution (Python):
s = input()
print('yes' if len(s) == len(set(s)) else 'no')

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

S.sort()

for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print('no')
        exit()
print('yes')

Solution (Python):
s = list(input())
if len(s) == len(list(set(s))):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
t=set(s)
print('yes' if len(s)==len(t) else 'no')

Solution (Python):
s = input()
l = list(s)
se = set(l)
if len(l) == len(se):
  print('yes')
else:
  print('no')

Solution (Python):
import sys
s = input()
cl = []
for i in range(len(s)):
  if (s[i] not in cl):
    cl.append(s[i])
  else:
    print('no')
    sys.exit()
print('yes')

Solution (Python):

def zeros(n): return [0 for i in range(n)]

s = input()
a = zeros(256)
res = 'yes'
for c in s:
    a[ord(c)] += 1
    if a[ord(c)]>1: 
        res = 'no'
        break
print(res)

Solution (Python):
s = input()

for i in range(0,len(s)-1,1):
    for j in range(i+1,len(s),1):
        if(s[i] == s[j]):
            print("no")
            exit()

print("yes")

Solution (Python):
a=input()
print("no"if len(set(a))!=len(a)else"yes")

Solution (Python):
from collections import Counter
S = input()
C = Counter(S).most_common()

ans = "yes"
for _k,v in C:
    if v>1:
        ans = "no"

print(ans)

Solution (Python):
s = input()
s2 = set(s)
if len(s) == len(s2):
  print('yes')
else:
  print('no')

Solution (Python):
S = input()
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Solution (Python):
s = str(input())
k = len(s)
L =[]
for i in range(k):
    L.append(s[i])
L_ = set(L)
K = len(L_)
if k == K:
    print("yes")
else:
    print("no")

Solution (Python):
S = input()
A = []
for i in range(len(S)):
    A.append(S[i])
Set = set(A)
if len(Set) == len(A):
    print("yes")
else:
    print("no")

Solution (Python):
s=input()
print("no" if len(s)-len(set(s)) else "yes")

Solution (Python):
s = input()
for c in s:
    if s.count(c) != 1:
        print('no')
        exit()
print('yes')

Solution (Python):
S = input()

from collections import Counter

cs = Counter(S)

if all(v <= 1 for v in cs.values()):
    print("yes")
else:
    print("no")

Solution (Python):
from collections import Counter
print("no" if max(Counter(list(input())).values())>1 else "yes")

Solution (Python):
s = list(input())
print("yes" if len(s) == len(list(set(s))) else "no")

Solution (Python):
s=list(input())
a=set(s)
if len(s)==len(a):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
a=set(s)
if len(s)==len(a):
    print("yes")
else:
    print("no")

Solution (Python):
[print("yes") if sorted(list(s)) == sorted(list(set(list(s)))) else print("no") for s in [input()]]

Solution (Python):
str_s = input()

if len(str_s) == len(set(str_s)):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
u=set(s)
if len(s)==len(u):
    print("yes")
else:
    print("no")

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

if(len(s) == len(set(s))):
    print('yes')
else:
    print('no')

Solution (Python):
def abc063_b():
    s = list(input())
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")


abc063_b()

Solution (Python):
S = input()
dic = [_ for _ in S]
flag = True
for i in dic:
    if dic.count(i) > 1:
        flag = False
        break
if flag:
    print('yes')
else:
    print('no')

Solution (Python):
s=input();print("yneos"[len(s)!=len(set(s))::2])

Solution (Python):
s = str(input())
s = sorted(s)
flag = "yes"
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print("no")
        flag = "no"
        break
if flag == "yes":
  print(flag)

Solution (Python):
s=input()
ans=1
for i in s:
  if s.count(i)!=1:
    ans=0
print(["no","yes"][ans])

Solution (Python):
S = input()
s = set(S)

if len(s) == len(S):
    print("yes")
else:
    print("no")

Solution (Python):

a = input()
if len(a) == len(set(a)):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
s.sort()
flag=True
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        flag=False
        break
if flag:
    print("yes")
else:
    print("no")

Solution (Python):



def main():
    """Function."""
    s = str(input())
    check = set()

    for i in range(len(s)):
        check.add(s[i])

    if len(s) != len(check):
        print("no")
    else:
        print("yes")


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
for s in S:
  if(S.count(s) != 1):
    print("no")
    break
else:
  print("yes")

Solution (Python):
def main():
    s = input()
    if len(s) == len(set(s)):
        print('yes')
    else:
        print('no')


if __name__ == '__main__':
    main()

Solution (Python):
_s = input()
s = [_s[i] for i in range(len(_s))]
s.sort()
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        print("no")
        exit()
print("yes")

Solution (Python):
import collections

S = list(input())
c = collections.Counter(S)
if (c.most_common()[0][1] != 1) :
    print("no")
else :
    print("yes")

Solution (Python):
s = input()
if len(set(s)) == len(s):
  print("yes")
else:
  print("no")

Solution (Python):
s=input()
print(['no', 'yes'][len(set(s)) == len(s)])

Solution (Python):
S = list(input())
print("yes" if len(S) == len(list(set(S))) else "no")

Solution (Python):
S = input()
SS = set()
for c in S:
    SS.add(c)
print("yes" if len(S)==len(SS) else "no")

Solution (Python):
S = raw_input()
print "yes" if len(S) == len(set(S)) else "no"

Solution (Python):
s=input()
print(['no','yes'][len(s) == len(set(s))])

Solution (Python):
S = input()
s = len(set(S))
l = len(S)
print(['no','yes'][s == l])

Solution (Python):
S=input()

if(len(S)-len(set(S))==0):
    print("yes")
else:
    print("no")

Solution (Python):
s=list(input())
print("yes" if len(s)==len(set(s)) else "no")

Solution (Python):

S = input()
print("yes" if len(S)==len(set(S)) else "no")

Solution (Python):

import sys

S = input()
for s in S:
    if S.count(s)!=1:
        print("no")
        sys.exit()
print("yes")

Solution (Python):

S = input()
lst = [s for s in S]
st = set(lst)

print("yes" if len(lst)==len(st) else "no")

Solution (Python):
line=input()
alphabets=[0,]*26
flg=0
for i in range(len(line)):
    alphabets[ord(line[i])-97]+=1
for i in range(len(alphabets)):
    if alphabets[i]>1:
        flg=1
if flg==0:
    print("yes")
else:
    print("no")