def insertion_sort(arr): for i in range(1, len(arr)): w = arr[i] j = i - 1 while j >= 0 and w < arr[j]: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = w return arr def bubble_sort(arr): n = len(arr) for i in range(n - 1): s = False for j in range(n - 1 - i): if arr[j] > arr[j + 1]: arr[j], arr[j + 1] = arr[j + 1], arr[j] s = True if not s: break return arr n = int(input()) if n % 3 == 0 and n % 5 == 0: print("can") else: print("cannot")