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=input()
if len(s) ==len(set(s)):
  print('yes')
else:
  print('no')

Solution (Python):
from collections import Counter
s=Counter(input()).most_common()
for _,i in s:
  if i !=1:
    print('no')
    exit()
print('yes')

Solution (Python):
S = input()
chars = set()
while S:
    if S[0] in chars:
        print('no')
        exit()
    chars.add(S[0])
    S = S[1:]
print('yes')

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

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

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

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

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

Solution (Python):
s_line = input()
s_file = {}
count = 0
for s in s_line:
    s_file[s] = 0
for s in s_line:
    s_file[s] += 1
    if s_file[s] > 1:
        print("no")
        break
    else:
        count += 1
if count == len(s_line):
    print("yes")

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

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

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

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

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

Solution (Python):
s =input()

set_s = set(s)

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

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

if s == t:
    print('yes')
else:
    print('no')

Solution (Python):
str_s = input()

for s in str_s:
    if str_s.count(s) > 1:
        print('no')
        exit()
print('yes')

Solution (Python):
s = input()
l = set(s)
if s.__len__() == l.__len__():
  print("yes")
else:
  print("no")

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

Solution (Python):
S = list(input().rstrip())
S.sort()

c = S[0]
result = 'yes'
for i in range(1, len(S)):
    if c != S[i]:
        c = S[i]
    else:
        result = 'no'
        break


print(result)

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

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

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

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

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

Solution (Python):
S = list(input())
ans = 'yes'
for i in range(len(S)):
	if S[i] in S[i+1:]:
		ans = 'no'
		break
print(ans)

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

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

Solution (Python):
S = input()
from collections import Counter
counter = Counter(S)
flag = 0
for i in range(len(counter)):
    if counter.most_common()[i][1] >= 2:
        flag = 1
        print("no")
        break
if flag == 0:
    print('yes')

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

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

Solution (Python):
s = input()
al = 'abcdefghijklmnopqrstuvwxyz'
li = list(al)

for item in li:
        if s.count(item) != 0 and s.count(item) != 1:
                print('no')
                break
else:
        print('yes')

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

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

Solution (Python):
import collections
S = input()
str = list(S)
count = collections.Counter(str)
if len(count) == len(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()

a=set(list(s))

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

Solution (Python):
from sys import stdin


def main() -> int:
    dic = dict()
    s = next_str()
    ans = "yes"

    for v in s:
        if v in dic:
            ans = "no"
        dic[v] = True
    
    print(ans)
    return 0


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
a = ""
for i in s:
    if i not in a:
        a += i
print("yneos"[(a != s)::2])

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

Solution (Python):
S = input()

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

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

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):
S = list(input())
if len(S) != len(set(S)):
    print('no')
else:
    print('yes')

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

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

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

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

Solution (Python):
listS = list(input())
listS.sort()

index=0
beforeC=""
while index < len(listS):
    if index ==0:
        beforeC=listS[index]
    else:
        if listS[index] == beforeC:
            print("no")
            break
        else:
            beforeC = listS[index]
    index+=1

if index== len(listS):
    print("yes")

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

Solution (Python):
s = input()

l = []

for i in range(len(s)):
    if s[i] in l:
        print("no")
        exit(0)

    else:
        l.append(s[i])


print("yes")

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
S = list(input())
flag = 0
for i in range(len(S)) :
    if S[i] in S[0:i] or S[i] in S[(i+1):len(S)] : 
        flag += 1
        break
if flag == 0 :
    print("yes")
else :
    print("no")

Solution (Python):
S=input()
l=len(S)
f=0
for x in range(l):
  for y in range(l):
    if x==y:
      continue
    else:
      if S[x]==S[y]:
        f=1
      else:
        continue
      
if f:
  print('no')
else:
  print('yes')

Solution (Python):
S = input()
tmp = []
for s in S:
    if s in tmp:
        print('no')
        exit()
    else:
        tmp.append(s)
print('yes')

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

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

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

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

from collections import Counter

s = lc()

cnt = Counter([])

for si in s:
    cnt[si] += 1
    

ans = True

for key, value in cnt.items():
    if value != 1:
        ans = False
        break
    
if ans:
    print("yes")
else:
    print("no")

Solution (Python):


s = input()
dic = {}
for c in s:
    if c not in dic:
        dic[c] = True
    else:
        print('no')
        exit()
print('yes')

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 = input()
sset = set(s)
if len(sset) == len(s):
  print('yes')
else:
  print('no')

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
c = list(input())

c.sort()
c = "".join(c)
for i in range(len(c)-1):
    if c[i+1]==c[i]:
        print("no")
        sys.exit()
print("yes")

Solution (Python):
S = list(input())
cnt = [0 for i in range(26)]
for i in S:
    cnt[ord(i) - 97] += 1
if max(cnt) == 1:
    print("yes")
else:
    print("no")

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

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

Solution (Python):
S = input()
A = []
ans = 'yes'
for s in S:
    if s in A:
        ans = 'no'
        break
    A.append(s)
print(ans)

Solution (Python):
s,temp = list(input()),[]
for i in range(len(s)):
    if s[i] in temp:
        print("no")
        exit()
    else:
        temp.append(s[i])
print("yes")

Solution (Python):
from collections import Counter
S=list(input())
cnt=Counter(S)
print('yes' if len(S)==len(cnt) else 'no')

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

Solution (Python):
S = input()

li = set()
for i in range(len(S)):
  li.add(S[i])

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

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

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

Solution (Python):
a = input()
b = []
for i in range(len(a)):
    if a[i] in b:
        print("no")
        exit()
    b.append(a[i])
print("yes")

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD




dp = None


def main():
    S = input()

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


main()

Solution (Python):
def main11():
    str = input("");
    flag = True;
    for i in range((len(str)-1)):
        for j in range(i+1,len(str)):
            if(str[i]==str[j]):
                flag = False;
    if flag:
        print("yes");
    else:
        print("no");



if __name__ == '__main__':
    main11()

Solution (Python):
s=input()
f=0
for i in range(len(s)):
    for j in range(len(s)):
        f+=i!=j and s[i]==s[j]
print("no"if f else"yes")

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

Solution (Python):
import sys
S=input()
alphabet=[chr(i) for i in range(97,97+26)]
for i in range (len(alphabet)):
    if S.count(alphabet[i])>1:
        print('no')
        sys.exit()
print('yes')

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

Solution (Python):

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

Solution (Python):
def solve():
    s = input()

    strs = {}
    for ss in s:
        if ss in strs.keys():
            print('no')
            return
        else:
            strs[ss] = 1

    print('yes')
    return

solve()

Solution (Python):
s = str(input())
dp=0
for i in range(len(s)-1):
    for j in range(i+1,len(s)):
        if s[i] == s[j]:
            dp += 1

if dp == 0:
    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())
ans="yes"
for c in s:
    if s.count(c) > 1:
        ans="no"
        break
print(ans)

Solution (Python):

s = str(raw_input())

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

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

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

print(ans)

Solution (Python):
import sys
s = list(input())
s_uniq = list(set(s))
 
print('yes' if len(s) == len(s_uniq) else 'no')
 
sys.exit(0)

Solution (Python):
import sys
s = list(input())
s_uniq = list(set(s))

print('yes' if len(s) == len(s_uniq) else 'no')

sys.exit(0)

Solution (Python):
import itertools
S = input()
for (i,j) in itertools.combinations(range(len(S)),2):
	if S[i] == S[j]:
		print("no")
		exit()
print("yes")

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


for i in s:
	if s.count(i) >1:
		print('no')
		exit(0)
		
print('yes')

Solution (Python):
S = input()
S = list(S)
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()
import collections
c = collections.Counter(s)
print("yes" if all(x == 1 for x in c.values()) else "no")

Solution (Python):

def main():
    s = list(input())

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

if __name__ == "__main__":
        main()

Solution (Python):
s = input()
import collections
c = collections.Counter(s)
print("yes" if all(x == 1 for x in c.values()) else "no")

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

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

Solution (Python):


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

if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()

words = []

for i in range(len(S)):
    if S[i] not in words:
        words.append(S[i])

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

Solution (Python):
def solve():
    s = list(input())
    len_bf = len(s)
    len_af = len(set(s))

    if len_bf == len_af:
        print("yes")
    else:
        print("no")

solve()

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

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

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

Solution (Python):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

S = list(input())

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

Solution (Python):
s=input()
cnt=[0 for i in range(26)]
for c in s:
  cnt[ord(c)-ord('a')]+=1
print('yes' if max(cnt)<2 else '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):
s = input()
flag=True
for i in range(len(s)):
  if s.count(s[i])>1:
    flag=False
    break
print('yes' if flag else 'no')

Solution (Python):


s = input()
dic = {}

res = True
for c in s:
    if c in dic:
        res = False
        break
    else:
        dic[c] = True

if res == True: print("yes")
else: print("no")

Solution (Python):
s = raw_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=list(input())

S2=list(set(S))

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

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

Solution (Python):
S = input()
S_set = set(S)
if len(S) == len(S_set):
  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())
S.sort()
N = len(S)
judge = "yes"
for i in range(N - 1):
	if S[i] == S[i + 1]:
		judge = "no"
		break

print(judge)

Solution (Python):
import string
import sys

s = input()

for char in string.ascii_lowercase:
  if s.count(char) > 1:
    print('no')
    sys.exit()

print('yes')

Solution (Python):


s = input()
for i in range(len(s)):
    if s[i] in s[:i] or s[i] in s[i+1:]:
        print('no')
        exit()
print('yes')

Solution (Python):
"""
https://abc063.contest.atcoder.jp/tasks/abc063_b
"""
s=input()
d=0
for i in range(len(s)):
    d=d+s.count(s[i])
if d==len(s):
    print("yes")
else:
    print("no")

Solution (Python):
S = input()
cnt = 0
for i in S:
    if S.count(i) >= 2:
        cnt += 1

if cnt  >= 1:
    print("no")
else:
    print("yes")

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

Solution (Python):

S = input()

S_set = set(S)

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

Solution (Python):

S = list(input())

S_set = set(S)

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

Solution (Python):


S = list(input())

S2 = list(set(S))

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

Solution (Python):
s = input()
flag = 0
b = []
for i in s:
    if i in b:
        flag = 1
    b.append(i)
if flag:
    print('no')
else:
    print('yes')

Solution (Python):
S = input()

input_set = set(S)

print("yes" if len(S) == len(input_set) else "no")

Solution (Python):
from collections import Counter
s = raw_input()
c = Counter(s)
if len(c) == len(s):
  print 'yes'
else:
  print 'no'

Solution (Python):
from collections import Counter
S = input()
C = Counter(S).most_common(1)
print("yes" if C[0][1]==1 else "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):
s = input()
a = len(s)
b = {i for i in s}
if len(s) - len(b):
    print('no')
else :
    print('yes')

Solution (Python):
from collections import Counter
S = input()
ctr = Counter(S)
m = ctr.most_common()[0][1]
print('yes' if m==1 else 'no')

Solution (Python):
S = input()

for i, chari in enumerate(S):
    for j, charj in enumerate(S):
        if i!=j and chari==charj:
            print("no")
            quit()
print("yes")

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

Solution (Python):
import sys
s = sys.stdin.readline().strip()
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

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

for c in S:
  if c not in vocab:
    vocab.add(c)
  else:
    print('no')
    exit()
print('yes')

Solution (Python):
import sys
s = sys.stdin.readline().strip()
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

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

Solution (Python):
s=input()

flag = 1
for target in s:
    count = 0
    for character in s:
        if character == target:
            count += 1
        if count >= 2:
            flag = 0
            break

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

Solution (Python):
S = input()

letters = []
for i in range(len(S)):
    if S[i] not in letters:
        letters.append(S[i])

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

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

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

Solution (Python):
S=input()
flug=True
nagasa=len(S)
for i in range(nagasa):
    for k in range(1,nagasa-i):
        if S[i:i+1]==S[i+k:i+k+1]:
            flug=False
            break
if flug==True:
    print("yes")
else:
    print("no")

Solution (Python):
from collections import defaultdict

S=input()
dict=defaultdict(int)
for i in range(len(S)):
  dict[S[i]]+=1

ans=True
for a,b in dict.items():
  if b>1:
    ans=False
    break
if ans:
  print("yes")
else:
  print("no")

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

Solution (Python):
s = input()
set = set()
for c in s:
    if(not c in set):
        set.add(c)
    else:
        print('no')
        exit()
print('yes')

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

Solution (Python):
str = input('')
ret = "yes"
for x in range(len(str)):
  for y in range(len(str)):
    if x == y:
      continue
    if str[x] == str[y]:
      ret = "no"
      break
print(ret)

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

Solution (Python):
s = [x for x in input()]
print('yes' if all([(s.count(c)==1) for c in s])  else 'no')

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

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

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

Solution (Python):
string = input()
flag = 0
for i in range(len(string)):
    for j in range(len(string)):
        if i!=j:
            if string[i]==string[j]:
                flag = 1
                break
if flag == 0:
    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()
ans=0
for x in set(s):
    if s.count(x)>1:
        ans+=1
print('yes') if ans==0 else print('no')

Solution (Python):

s = input()
ss = set(s)

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

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

Solution (Python):
a = input()
ans = 'yes'
for i in a:
    if a.count(i) >= 2:
        ans = 'no'
print(ans)

Solution (Python):
def a():
    S = input()
    R = set()
    for i in S:
        if i in R:
            print("no")
            return
        else:
            R.add(i)
    print("yes")
    return
            
a()

Solution (Python):
import collections
import sys

S = input()
S = list(S)

c = collections.Counter(S)
for i in c.values():
   if i >= 2:
      print('no')
      sys.exit()

print('yes')

Solution (Python):
S = input()

l = []

ans = 'yes'

for s in S:
    if s not in l:
        l.append(s)
    else:
        ans = 'no'
        break

print(ans)

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

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

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

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

Solution (Python):
from collections import Counter

s = input()
c = Counter(s)
print('yes') if len(s) == len(c) else print('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(s)):
    print('yes')
else:
    print('no')

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

Solution (Python):





if __name__ == '__main__':
    s = input()
    set_s = set(s)

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

s=arr_data[0][0]


arr=[]


for v in s:
    
    arr.append(v)
    
    
arr02=sorted(arr)




chkflg=True


for i in range(0,len(arr02)-1):
    

    
    if arr02[i]==arr02[i+1]:
        
        chkflg=False
        
        break
        
if chkflg:
    
    print("yes")
    
else:
    
    print("no")

Solution (Python):
s = input()
x = set()
for i in s:
	x.add(i)
if len(x)==len(s): print("yes")
else: print("no")

Solution (Python):
S = input()

SS = set(list(S))

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

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

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

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

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

Solution (Python):
n = input()
lis = []
for i in range(0,len(n)):
    if n[i] not in lis:
        lis.append(n[i])
    else:
        print("no")
        break
    if i == len(n)-1:
        print("yes")

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

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

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

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

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

Solution (Python):
s=input()
seen=set()
for i in s:
	if i in seen:
		print('no')
		exit()
	seen.add(i)
print('yes')

Solution (Python):
from collections import Counter
S = input().strip()
s = Counter(S)
for k,v in s.items():
  if v>=2:
    import sys
    print('no')
    sys.exit(0)
else:
  print('yes')

Solution (Python):
s = input()

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

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

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

Solution (Python):
import numpy as np
import pdb

def main():
    string = list(raw_input())
    stringset = set(string)
    if len(string) > len(stringset):
        print 'no'
    else:
        print 'yes'


if __name__ == '__main__':
    main()

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 print("no")

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

Solution (Python):
from collections import Counter

k = list(raw_input())
counted = Counter(k)
for key, value in counted.iteritems():
    if value > 1:
        print "no"
        exit()

print "yes"

Solution (Python):

import collections

s = input()

a = any(map(lambda s: s > 1, collections.Counter(s).values()))

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

Solution (Python):
from collections import Counter
s=list(str(input()))
duplication = [i for i,v in Counter(s).items() if v>1]
print(['no','yes'][duplication ==[]])

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

Solution (Python):
def hikaku(S):
    for i in range(1,len(S)):
        if S[i]==S[i-1]:
            return "no"

    return "yes"


S=list(input())

S.sort()

print(hikaku(S))