编程题：假设一个包含n（0

假设一个包含n（0<n<=15）个单词的词典：{"the","more","data","better","performance","of","machine","learning","algorithms","which","one","is","important","in","or"} ，输入n的值，基于此词典统计文本里单词出现的次数。
给定文本：the more the data, the better the performance of machine learning algorithms.
输入：15
则输出：4 1 1 1 1 1 1 1 1 0 0 0 0 0 0
输入：3
则输出：4 1 1




在这里给出一组输入。例如：

in
15


### 输出样例:

在这里给出相应的输出。注意输出格式，最后有一个空格。

out
4 1 1 1 1 1 1 1 1 0 0 0 0 0 0








答案：若无答案欢迎评论