from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    X = int(input())

    print('Yes') if X >= 30 else print('No')

if __name__ == '__main__':
    main() from fractions import gcd from collections import Counter, deque, defaultdict from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort from itertools import accumulate, product, permutations, combinations def main():
    X = int(input())

    print('Yes') if X >= 30 else print('No') main X = int(input()) X int(input()) int input() input print('Yes') if X >= 30 else print('No') X >= 30 X 30 print('Yes') print 'Yes' print('No') print 'No' if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def main():
    X = int(input())

    print('Yes') if X >= 30 else print('No') def main():
    X = int(input())

    print('Yes') if X >= 30 else print('No') main
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    X = int(input())

    print('Yes') if X >= 30 else print('No')

if __name__ == '__main__':
    main()