import sys
input = sys.stdin.read
output = sys.stdout.write
N = int(input().strip())
pigeon_counts = {}
def query_pigeonhole(i):
    output(f'? {i}\n')
    sys.stdout.flush()
    count = int(sys.stdin.readline().strip())
    pigeon_counts[i] = count
    return count
for i in range(1, min(N + 1, 11)):
    query_pigeonhole(i)
reverse_lookup = {}
found_duplicate = False
result = "No\n"
for pigeonhole, count in pigeon_counts.items():
    if count in reverse_lookup:
        result = f"Yes\n{reverse_lookup[count]} {pigeonhole}\n"
        found_duplicate = True
        break
    reverse_lookup[count] = pigeonhole
output(result)