import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random #sys.setrecursionlimit(10**9) #sys.set_int_max_str_digits(0) #input = sys.stdin.readline n = int(input()) #alist = list(map(int,input().split())) #alist = [] s = input().rstrip() #n,m = map(int,input().split()) #for i in range(n): # alist.append(list(map(int,input().split()))) if n % 2 == 1: exit(print('No')) print('Yes') a = [] b = [] for i in range(n): if i % 2 == 0: a.append(s[i]) else: b.append(s[i]) print(''.join(a),''.join(b))