Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter


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

INF = 1 << 60


def read_int():
    return int(readline())


def read_int_n():
    return list(map(int, readline().split()))


def read_float():
    return float(readline())


def read_float_n():
    return list(map(float, readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()


def ep(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.perf_counter()
        ret = f(*args, **kwargs)
        e = time.perf_counter()

        ep(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A, B):
    ac = Counter(A)
    bc = Counter(B)
    ma = ac.most_common()[0][0]
    mb = bc.most_common()[0][0]

    if ma == mb and ac[ma] > N//2 and bc[mb] > N//2:
        print('No')
        return

    print('Yes')
    from random import shuffle
    while True:
        shuffle(B)
        if all(map(lambda x: x[0]!=x[1], zip(A, B))):
            print(*B)
            break


def main():
    N = read_int()
    A = read_int_n()
    B = read_int_n()
    (slv(N, A, B))


if __name__ == '__main__':
    main()


Fixed submission:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter


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

INF = 1 << 60


def read_int():
    return int(readline())


def read_int_n():
    return list(map(int, readline().split()))


def read_float():
    return float(readline())


def read_float_n():
    return list(map(float, readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()


def ep(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.perf_counter()
        ret = f(*args, **kwargs)
        e = time.perf_counter()

        ep(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A, B):
    B.reverse()
    # ep(A)
    # ep(B)

    ng = []
    ngi = set()
    for i, (a, b) in enumerate(zip(A, B)):
        if a == b:
            ng.append((i, a, b))


    for i in range(N):
        if not ng:
            break
        if i != ng[-1][0] and B[i] != ng[-1][2] and A[i] != ng[-1][1]:
            j, a, b = ng.pop()
            B[i], B[j] = B[j], B[i]



    if all(map(lambda x: x[0] != x[1], zip(A, B))):
        print('Yes')
        print(*B)
    else:
        print('No')


def main():
    N = read_int()
    A = read_int_n()
    B = read_int_n()
    (slv(N, A, B))


if __name__ == '__main__':
    main()