Problem:
 Score : 100 points    Problem Statement You are given a string S of length 3 consisting of a , b and c . Determine if S can be obtained by permuting abc .      Constraints  |S|=3  S consists of a , b and c .         Input Input is given from Standard Input in the following format:  S       Output If S can be obtained by permuting abc , print Yes ; otherwise, print No .        Sample Input 1 bac      Sample Output 1 Yes  Swapping the first and second characters in bac results in abc .       Sample Input 2 bab      Sample Output 2 No       Sample Input 3 abc      Sample Output 3 Yes       Sample Input 4 aaa      Sample Output 4 No

Solution (Python):
s = input()

a = 0
b = 0
c = 0

for i in range(3):
    if s[i] == 'a':
        a += 1
    elif s[i] == 'b':
        b += 1
    elif s[i] == 'c':
        c += 1

if a == b and b == c:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
count = 0
if "a" in S:
  count = count + 1

if "b" in S:
  count = count + 1

if "c" in S:
  count = count + 1

if count==3:
  print("Yes")
else:
  print("No")

Solution (Python):
S=set(input())
print("Yes" if len(S)==3 else "No")

Solution (Python):
def readints():
    return list(map(int, input().split()))


s = str(input())
if 'a' in s and 'b' in s and 'c' in s:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if "a" in S and "b" in S and "c" in S:
    print("Yes")
else :
    print("No")

Solution (Python):
if sorted(list(input()))==list('abc'):
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
print("Yes" if len(set(s))==3 else "No")

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

if S==["a","b","c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = sorted(input())
if S == sorted('abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
print(["No","Yes"][len(set(input()))==3])

Solution (Python):
S=input()
T=sorted(S)
if T[0]=="a" and T[1]=="b" and T[2]=="c":
	print("Yes")
else:
	print("No")

Solution (Python):
def main():
    string = input()
    if string.count("a") == 1 and string.count("b") == 1 and string.count("c") == 1:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
S = sorted(input())
if S == sorted('abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
S=str(input())
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if set('abc')==set(s): print('Yes')
else: print('No')

Solution (Python):
S = input()
if len(set(S)) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if len(set(s)) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
a = ['a','b','c']
s.sort()
if s == a:
    print('Yes')
else:
    print('No')

Solution (Python):
S = sorted(input())
print('Yes' if S[0] == 'a' and S[1] == 'b' and S[2] == 'c' else 'No')

Solution (Python):
S = input()

_ = ''.join(sorted(S))
if _ == 'abc':
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

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

if len(s) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()

l = []
for x in s:
  l.append(x)

if len(set(l)) == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s[0] != s[1] and s[0] != s[2] and s[1] != s[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = sorted(input())
if s == ["a","b","c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
print('Yes') if len(set(S)) == 3 else print('No')

Solution (Python):

S = input()

listS = list(S)
listS.sort()

correct = ["a","b","c"]

if listS == correct :
    print("Yes")
else :
    print("No")

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
S=input()
if S=="abc" :
  print("Yes")
elif S=="bca" :
  print("Yes")
elif S=="cba" :
  print("Yes")
elif S=="acb" :
  print("Yes")
elif S=="bac" :
  print("Yes")
elif S=="cab" :
  print("Yes")
else :
  print("No")

Solution (Python):
if len(set(list(input())))==3:print("Yes")
else:print("No")

Solution (Python):

S = list(input())

if S.count('a') ==1 and S.count('b') and S.count('c'):
    print('Yes')
else:
    print('No')

Solution (Python):
S = sorted(input())
if S == list('abc'):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if len(set(s)) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
S = str(input())
S1 = ["a", "b", "c"]
if S.count(S1[0]) == 1 and S.count(S1[1]) == 1 and S.count(S1[2]) == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
print('Yes' if sorted(input()) == ['a', 'b', 'c'] else 'No')

Solution (Python):
print('Yes' if sorted(input())==list('abc') else 'No')

Solution (Python):
s = input()
if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1 :
    print("Yes")
else:
    print("No")

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

if 'a' in inp and 'b' in inp and 'c' in inp:
    print('Yes')
else:
    print('No')

Solution (Python):
print('YNeos'[''.join(sorted(list(input())))!='abc'::2])

Solution (Python):




def main():
    S = input()
    print('Yes'if 'a'in S and 'b'in S and 'c'in S else 'No')


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
list = [s[0], s[1], s[2]]
if list.count("a") > 0 and list.count("b") > 0 and list.count("c") > 0: print("Yes")
else: print("No")

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

new_S = sorted(S)
if new_S == ['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input().strip()
s = "".join(sorted(list(s)))
if s == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
S = input()
x = dict()
ans = 0
for i in range(len(S)):
    x[S[i]] = 1
for idx in x:
    ans += x[idx]
if ans == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
print("YNeos"[set(input())!=set("abc")::2])

Solution (Python):
s=input()
if s.count("a")==1 and s.count("b")==1 and s.count("c")==1:
    print("Yes")
else:
    print("No")

Solution (Python):













s = input()
if 'a' in s and'b' in s and'c' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
check = "a" in s and "b" in s and "c" in s
if check:
    print("Yes")
else:
    print("No")

Solution (Python):
print("Yes" if set(list(input())) == set(["a", "b", "c"]) else "No")

Solution (Python):
n = input()
if "a" in n and "b" in n and "c" in n:
  print("Yes")
else:
  print("No")

Solution (Python):
s = list(str(input()))
a = 0
b = 0
c = 0
for i in range(len(s)):
    if s[i] == 'a':
        a += 1
    elif s[i] == 'b':
        b += 1
    elif s[i] == 'c':
        c += 1

if a == 1 and b == 1 and c == 1:
    print('Yes')
else:
    print('No')

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

if(l[0]=="a")and(l[1]=="b")and(l[2]=="c"):
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if len(set(s)) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if 'a' in S and 'b' in S and 'c' in S:
    g = 'Yes'

else:
    g = 'No'
print('{}'.format(g))

Solution (Python):
S = list(input())
if ("a" in S) and ("b" in S) and ("c" in S):
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
if len(set(S))==3:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[0]!=s[1] and s[1]!=s[2] and s[2]!=s[0]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
s.sort()
if s == list("abc"):
    print("Yes")
else:
    print("No")

Solution (Python):
S = list(map(str, input()))
ctr = [0 for _ in range(3)]

for s in S:
  if s == "a":
    ctr[0] = 1
  elif s == "b":
    ctr[1] = 1
  else:
    ctr[2] = 1
    
if sum(ctr) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
a=S.count("a")
b=S.count("b")
c=S.count("c")

if a==b==c==1:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = input()
print("Yes" if s.count("a")*s.count("b")*s.count("c") == 1 else "No")

Solution (Python):
s = input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
line = input()

if "a" in line and "b" in line and "c" in line:
    print("Yes")
else:
    print("No")

Solution (Python):
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8').rstrip()
print('Yes' if set('abc') == set(S) else 'No')

Solution (Python):
s = [i for i in str(input())]
print("Yes" if sorted(s) == ["a","b","c"] else "No")

Solution (Python):
s = input()
if (s[0] == s[1] or s[1] == s[2] or s[2] == s[0]):
    print("No")
else:
    print("Yes")

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

s = readline()
print("Yes" if len(s)==len(set(s)) else "No")

Solution (Python):
s=sorted(input())
ans="abc"
flag=1
for i in range(3):
  if s[i] != ans[i]:
    print("No")
    flag=0
    break

if flag==1:
  print("Yes")

Solution (Python):
S = input()

if S.count('a') == 1 and S.count('b') == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if "".join(sorted(s)) == "abc":
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
print("Yes" if len(s)==len(set(s)) else "No")

Solution (Python):
S = input()

if sorted(S) == ['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()

if S.count('a')==1 and S.count('b')==1 and S.count('c')==1:
    print('Yes')
else:
    print('No')

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
s = input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
s = list(input())
if len(set(s)) == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
print('Yes' if ''.join(sorted(input()))=='abc' else 'No')

Solution (Python):
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    
    
    

    
    
    res = sorted(list(r))
    if "".join(res) == 'abc':
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
print("YNeos"["".join(sorted(input()))!="abc"::2])

Solution (Python):


import numpy as np

s=sorted(input())

if(s==list("abc")):print("Yes")
else:print("No")

Solution (Python):
n=len(set(input()))
if n==3:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
s = ''.join(sorted(s))
if s == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
print("No"if len(set(input()))-3 else "Yes")

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
S = input()
if all(S.count(l)==1 for l in "abc"):
    print("Yes")
else:
    print("No")

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

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

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    s = input()
    t = sorted(s)
    if ''.join(t) == 'abc':
        print('Yes')
    else:
        print('No')
    return

if __name__=='__main__':
    main()

Solution (Python):
n=input()
print("Yes" if len(set(n))==3 else "No")

Solution (Python):
S = ''.join(sorted(input()))

if S == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()

print("Yes" if len(set(s))==3 else "No")

Solution (Python):
s = input()
if (s.count('a') == 1 and s.count('b') and s.count('c')): print('Yes')
else: print('No')

Solution (Python):
if len(set(input())) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
li = [a for a in s]
li.sort()
t = ''.join(li)

if t == 'abc':
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S.count('a') == S.count('b') == S.count('c') == 1:
  r = 'Yes'
else:
  r = 'No'
print(r)

Solution (Python):
print('Yes' if len(set(input())) == 3 else 'No')

Solution (Python):
alp = input()

if(alp[0] != alp[1] and alp[1] != alp[2] and alp[0] != alp[2]):
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
c = Counter(input())
print('Yes' if 'a' in c and 'b' in c and 'c' in c else 'No')

Solution (Python):
S = input()

for s in "abc":
  if s not in S:
    print("No")
    exit()
print("Yes")

Solution (Python):
lst1 = list(input())
if len(lst1) != 3:
    print("No")
    exit()
for i in ["a","b","c"]:
    if not i in lst1:
        print("No")
        exit()
print("Yes")

Solution (Python):
s = input()
if ord(s[0]) + ord(s[1]) + ord(s[2]) == ord('a') + ord('b') + ord('c'):
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
na = 0
nb = 0
nc = 0

for c in s:
  if c == 'a': na += 1
  if c == 'b': nb += 1
  if c == 'c': nc += 1

if na == nb == nc:
  print('Yes')
else:
  print('No')

Solution (Python):
list=input()
if "a" in list and "b" in list and "c" in list:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if 'a' in s and 'b' in s and 'c' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(input())
a.sort()
b = "".join(a)
if b == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
S = list(input())
S.sort()
if S[0] == "a" and S[1] == "b" and S[2] == "c":
    print("Yes")
else:
    print("No")

Solution (Python):
S = set(input())
print("Yes" if S == {"a", "b", "c"} else "No")

Solution (Python):
sSorted = sorted(input())
if ''.join(sSorted) =="abc":
  print("Yes")
else:
  print("No")

Solution (Python):
S = list(input())
S.sort()
ans = "No"
if S[0] == "a" and S[1] == "b" and S[2] == "c" :
    ans = "Yes"
print(ans)

Solution (Python):
a=sorted(input())
abc='abc'
count=0
for i in range(3):
  if a[i]==abc[i]:
    count+=1
if count == 3:print('Yes')
else:print('No')

Solution (Python):
s=input()
if "".join(sorted(s))=="abc":
  print("Yes")
else:
  print("No")

Solution (Python):
S = list(input())
if sorted(S) == ['a','b','c']:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
li = ['a','b','c']
li = set(li)
print('Yes' if li == set(s) else 'No')

Solution (Python):
import sys
input = sys.stdin.readline
s=input().strip()
a=[]
for i in range(3):
    a.append(s[i])
a.sort()
if a[0]=="a" and a[1]=="b" and a[2]=="c":
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
input = sys.stdin.readline
S = list(input().strip())
count = 0
for i in range(3):
    if S[i%3] != S[(i+1)%3]:
        count += 1
if count == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if s.count('a') == s.count('b') == s.count('c'):
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
s = input()
s_list = [s[0], s[1], s[2]]
if 'a' in s_list and 'b' in s_list and 'c' in s_list:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
input = sys.stdin.readline
import collections
S = list(input())
c = collections.Counter(S)
if c["a"] == 1 and c["b"] == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
cnt_a=s.count('a')
cnt_b=s.count('b')
cnt_c=s.count('c')
if cnt_a==cnt_b==cnt_c:
    print('Yes')
else:
    print('No')

Solution (Python):
print('Yes' if sorted(input()) == list('abc') else 'No')

Solution (Python):
print('Yes' if sorted(input()) == list('abc') else 'No')

Solution (Python):
S = input()
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else: print('No')

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

if S ==  list("abc"):
    print("Yes")
else:print("No")

Solution (Python):
s=input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[0]:
  print('No')
else:
  print('Yes')

Solution (Python):
s = input()
print("Yes" if len(set(s)) == 3 else "No")

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

if sorted(s) == ['a', 'b', 'c']:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
a = sorted(s, key=lambda x: x[0], reverse=False)
k = (a[0]=='a') and (a[1] == 'b') and (a[2] == 'c')
print('Yes' if k else 'No')

Solution (Python):
s = input()
if s.count('a') == 1 and s.count('b') == 1 and s.count('c'):
    print("Yes")
else:
    print("No")

Solution (Python):
s = str(input())
a,b,c = 0,0,0

for i in s:
    if i == "a":
        a += 1
    if i == "b":
        b += 1
    if i == "c":
        c += 1

if a == 1 and b == 1 and c == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
ref = ['a', 'b', 'c']
s = list(input())
s.sort()

if (s == ref):
   print('Yes')
else:
   print('No')

Solution (Python):
s = input()

if ("a" in s) and ("b" in s) and ("c" in s):
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
print("Yes" if S.count("a")==1 and S.count("b")==1 and S.count("c")==1 else "No")

Solution (Python):
s = input()
ans = "Yes" if len(set(s))==3 else "No"
print(ans)

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

S = set(S)

if len(S)==3:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
a=s.count('a')
b=s.count('b')
c=s.count('c')
if a==1 and b==1 and c==1:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()

def main():
    return 'Yes' if ''.join(sorted(s)) == 'abc' else 'No'

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

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()

def main():
    return 'Yes' if ''.join(sorted(s)) == 'abc' else 'No'

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

Solution (Python):
a = list(input())
if 'a' in a and 'b' in a and 'c' in a:
    print('Yes')
else:
    print('No')

Solution (Python):
print("Yes" if len(set(input()))==3 else "No")

Solution (Python):
s = set(input())
if len(s) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
l = len(set(n))
print("Yes" if l == 3 else "No")

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(S: str):
    if len(set([S[0], S[1], S[2]])) == 3:
        print(YES)
    else:
        print(NO)


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

if __name__ == '__main__':
    main()

Solution (Python):
s = set(input())
t = {'a','b','c'}

print('Yes' if s==t else 'No')

Solution (Python):
s = input()

a = 0
b = 0
c = 0

for i in range(3):
    if s[i] == 'a':
        a = 1
    elif s[i] == 'b':
        b = 1
    elif s[i] == 'c':
        c = 1
        
if a*b*c==1:
    print('Yes')
else:
    print('No')

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

if "a" in S and "b" in S and "c" in S:
    print("Yes")

else:
    print("No")

Solution (Python):

ans=input()
a=0
b=0
c=0
for i in ans:
    if i=='a':
        a+=1
    elif i=='b':
        b+=1
    elif i=='c':
        c+=1

if a==1 and b==1 and c==1:
    print("Yes")
else:
    print("No")


"""
bac

Yes


bab

No

abc

Yes

aaa

No
"""

Solution (Python):
a=input()
if a.count('a')==a.count('b')==a.count('c')==1:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
ans = 'Yes'
for c in ['a', 'b', 'c']:
	if c not in s:
		ans = 'No'
		break
print(ans)

Solution (Python):
s = input()
print('Yes' if ('a' in s) and ('b' in s) and ('c' in s) else 'No')

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

T = {"a", "b", "c"}

if T == S:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
s_list = []
cnt = 0
for i in s:
    s_list.append(i)
s_list.sort()
if "".join(s_list) == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
import math

s = set(input())
print("Yes" if s == {"a", "b", "c"} else "No")

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

print('Yes' if s.count('a')==1 and s.count('b')==1 else 'No')

Solution (Python):
s = input()
moji =''
if(moji.join(sorted(s))=="abc"):
	print("Yes")
else:
	print("No")

Solution (Python):
import sys

a = set(input())

if len(a) == 3:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
s=list(s)
s.sort()
if s==["a","b","c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
if list(sorted(list(str(input())))) == ["a", "b", "c"] :
  print("Yes")
else :
  print("No")

Solution (Python):
S = str( input() )
abclist = [ "abc", "acb", "bac", "bca", "cab", "cba" ]

if S in abclist:
   print( "Yes" )
else: 
   print( "No" )

Solution (Python):
import numpy as np

s = input()
if s.count("a")*s.count("b")*s.count("c")==0:
    print("No")
else:
    print("Yes")

Solution (Python):
s=list(input())
s.sort()
if s==["a","b","c"]:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

print("Yes" if s.count("a") == 1
            and s.count("b") == 1 
            and s.count("c") == 1
            else "No")

Solution (Python):
print("Yes" if len(set(input())) == 3 else "No")

Solution (Python):
s = list(input())
a = s.count("a")
b = s.count("b")
c = s.count("c")
if a == 1 and b == 1 and c == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
if len(set(input()))==3:print('Yes')
else:print('No')

Solution (Python):
s = input()

print('Yes' if len(set(s)) == 3 else 'No')

Solution (Python):
def Inn(s, t):
  return (t in s)

s = input()
if Inn(s, 'a') and Inn(s, 'b') and Inn(s, 'c'):
  print('Yes')
else:
  print('No')

Solution (Python):
s = sorted(list(input()))
if s == ["a", "b", "c"]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if 'a' in s and 'b' in s and 'c' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    S=STR()
    l=sorted(S)
    
    if l[0]=='a' and l[1]=='b' and l[2]=='c':
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

Solution (Python):
if ("".join(sorted(input())) == "abc"):
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(input())
a.sort()
if a == ["a","b","c"]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = list(input())
s.sort()
s = ''.join(s)
if s == "abc":
    print('Yes')
else:
    print('No')

Solution (Python):
a = sorted(input())
a ="".join(a)
print("Yes" if a =="abc" else "No")

Solution (Python):
s = input()
if ("a" in s) and ("b" in s) and ("c" in s):
    print('Yes')
else:
    print('No')

Solution (Python):
if list("abc")==sorted(input()):
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
print('Yes' if 'a' in S and 'b' in S and 'c' in S else 'No')

Solution (Python):
S = input()
a, b, c = 0, 0, 0
for i in S:
    if i == 'a': a += 1
    if i == 'b': b += 1
    if i == 'c': c += 1
print('Yes' if a == 1 and b == 1 and c == 1 else 'No')

Solution (Python):
s=list(input())
ss=set(s)
if len(ss)==3:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if "".join(sorted(S)) == "abc":
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print('Yes' if 'a' in s and 'b' in s and 'c' in s else 'No')

Solution (Python):
s = str(input())
if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

s = list(input()[:-1])
s.sort()
print('YNeos'[s != list('abc')::2])

Solution (Python):
S = list(input())
S.sort()
print("Yes" if "".join(S) == "abc" else "No")

Solution (Python):
S=list(map(str,input()))
print("No" if S[0]==S[1] or S[1]==S[2] or S[0]==S[2] else "Yes")

Solution (Python):
n = input()
a = n.count('a')
b = n.count('b')
c = n.count('c')
if a == 1 and b == 1 and c == 1:
    print('Yes')
else:
    print('No')

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

if "a" in S and "b" in S and "c" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()

if set(s)=={'a', 'b', 'c'}:
    print('Yes')
else:
    print('No')

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

if ''.join(ss) =='abc':
  print('Yes')
else:
  print('No')

Solution (Python):
print("Yes" if ''.join(sorted(str(input())))=="abc" else "No")

Solution (Python):
S = input()
if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print('Yes') if s[0] != s[1] and s[1] != s[2] and s[0] != s[2] else print('No')

Solution (Python):
from itertools import permutations

S=input()
cand=["".join(t) for t in list(permutations(["a","b","c"],3))] 

if S in cand: 
    print("Yes")
else: 
    print("No")

Solution (Python):
print('Yes' if len(set(input())) == 3 else 'No')

Solution (Python):
a = sorted(input())
a = ''.join(a)
print("Yes" if a=='abc' else "No")

Solution (Python):
if sorted(input()) == ["a", "b", "c"]:
    print("Yes")
else:
    print("No")

Solution (Python):

import math





S = str(input())

if "a" in S and "b" in S and "c" in S :
  print ("Yes")
else :
  print ("No")

Solution (Python):
S = list(input())
if 'a' in S and 'b' in S and 'c' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
s = list(input())
print("Yes" if(sorted(s) == ["a", "b", "c"]) else "No")

Solution (Python):
s=input()
l=["abc","acb","bac","bca","cab","cba"]
if s in l:
  print("Yes")
else:
  print("No")

Solution (Python):

import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

s = input()
C = collections.Counter(s)

for si in ("a","b","c"):
    if C[si]!=1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
s = input()

if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Solution (Python):
s = list(input())
ac = 0
bc = 0
cc = 0
for i in s:
  if i == "a":
    ac += 1
  elif i == "b":
    bc += 1
  elif i == "c":
    cc += 1
if ac == 1 and bc == 1 and cc == 1:
  print("Yes")
else:
  print("No")

Solution (Python):

import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

s = input()
C = collections.Counter(s)

for si in ("a","b","c"):
    if C[si]!=1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
S = input()
if "".join(sorted(S)) == "abc":
  print("Yes")
else:
  print("No")

Solution (Python):
def examA():
    S = SI()
    ans = "No"
    if "a" in S and "b" in S and "c" in S:
        ans = "Yes"
    print(ans)

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Solution (Python):
s=input()
print("Yes" if len(set(s))==3 else "No")

Solution (Python):
S = input()

Rea=S.count('a')
Reb=S.count('b')
Rec=S.count('c')

if Rea == 1 and Reb == 1 and Rec == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
print('Yes' if len(set(input()))==3 else 'No')

Solution (Python):
L=set(input())
if len(L)==3:
  print('Yes')
else :
  print('No')

Solution (Python):
s = input()
ans = "Yes" if set(list(s)) == set(["a", "b", "c"]) else "No"
print(ans)

Solution (Python):
s = input()

if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
print("Yes" if set(input()) == {"a","b","c"} else "No")

Solution (Python):
s=input()
print('Yes'if s[0]!=s[1]!=s[2]!=s[0]else'No')

Solution (Python):
s=input()
if len(set(s))==3:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()

abc_list = ["abc", "acb", "bac", "bca", "cab", "cba"]

if S in abc_list:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if (("a" in S) and ("b" in S)) and ("c" in S):
  print ("Yes")
else:
  print ("No")

"""
ちょっとした解説

Sは3文字なので、a,b,cのすべての文字が含まれていれば"abc"を並び替えて作ることが出来ます。
逆に一つでもかけていた場合は"abc"の並び替えで作ることはできません。
よってin演算子でa,b,cが全てはいっているか調べてあげればよいです。

and演算子で3つの条件式をつなぐのを思いつくことも一つのポイント
実はカッコは不要で、if　("a" in S) and ("b" in S) and ("c" in S):
でもちゃんと動きます。
"""

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    S=set(input())
    print("Yes" if(len(S)==3) else "No")
resolve()

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
if "a" in a and "b" in a and "c" in a:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print("Yes" if s.count("a") == 1 and s.count("b") == 1 else "No")

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

if (ls_s[0] == ls_s[1]) or (ls_s[1] == ls_s[2]) or (ls_s[2] == ls_s[0]):
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
len = len(set(s))
if len == 3 :
    print("Yes")
else :
    print("No")

Solution (Python):
s = input()
if 'a' in s and 'b' in s and 'c' in s:
    print('Yes')
else:
    print('No')

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

if S == ["a", "b", "c"]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):
n=str(input()) 
a = n.count("a")
b = n.count("b")
c = n.count("c")
if a==b==c==1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

l = list(n)

l.sort()

k = l[0]+l[1]+l[2]

if k == 'abc':
	print('Yes')
else:
	print('No')