import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N = NI()
    A = NLI()
    A = [x-1 for x in A]
    seen = [0] * N
    even = 0
    for s in range(N):
        if seen[s]:
            continue
        B = []
        G = []
        while not seen[s]:
            B.append(s)
            G.append(A[s])
            seen[s] = 1
            s = A[s]
        even += len(B) % 2 == 0

    if even % 2:
        print("No")
    else:
        print("Yes")



if __name__ == "__main__":
    main()