You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = q) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.

Input

The first line contains a positive integer k (1 ≤ k ≤ 26) — the number of strings that should be in a beautiful sequence. 

The second line contains string q, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;

public class P1 {

	public static void main(String[] args) {
		FastScanner scanner = new FastScanner();
		OutputWriter out = new OutputWriter();
		int k = scanner.nextInt();
		String q = scanner.next();
		char[] chars = q.toCharArray();
		ArrayList<Integer> ans = new ArrayList<Integer>();
		ans.add(0);
		outer: for (int i = 1; i < chars.length && ans.size() < k; i++) {
			for (int j = 0; j < ans.size(); j++) {
				if (chars[i] == chars[ans.get(j)])
					continue outer;
			}
			ans.add(i);
		}
		if (ans.size() < k)
			System.out.println("NO");
		else {
			System.out.println("YES");
			ans.add(chars.length);
			for (int i = 0; i < k; i++) {
				System.out.println(q.substring(ans.get(i), ans.get(i + 1)));
			}
		}
	}
}

class FastScanner {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;

	public FastScanner() {
		this.stream = System.in;
	}

	public FastScanner(InputStream stream) {
		this.stream = stream;
	}

	public FastScanner(String fileName) {
		try {
			this.stream = new FileInputStream(fileName);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	public int nextChar() {
		if (numChars == -1)
			throw new InputMismatchException();

		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = nextChar();
		while (isSpaceChar(c))
			c = nextChar();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = nextChar();
		}

		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = nextChar();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String readString() {
		int c = nextChar();
		while (isSpaceChar(c))
			c = nextChar();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = nextChar();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	private boolean isSpaceChar(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public String next() {
		return readString();
	}
}

class OutputWriter {

	private PrintWriter writer;

	public OutputWriter() {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
	}

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(String fileName) {
		try {
			writer = new PrintWriter(fileName);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	public void print(String s) {
		writer.print(s);
	}

	public void println(String s) {
		writer.println(s);
	}

	public void close() {
		writer.close();
	}

	public void flush() {
		writer.flush();
	}
}