#include <iostream>
using namespace std;

int main()
{
    string arr;
    cin >> arr;
    int n;//用来记录是n*n的方阵
    for (int i = 0;; i++)
        if (arr[i] == '\0')
        {
            n = i;//读取第一行，获得方阵大小n
            break;
        }
    char ch;
    bool *word = (bool *)malloc(sizeof(bool) * n * n);//声明n*n的方阵
    for (int i = 0; i < n; i++)//读入第一行
        word[i] = arr[i] - 48;
    for (int i = n; i < n * n; i++)//读入剩余行
    {
        cin >> ch;
        if (ch == '0' || ch == '1')
            word[i] = ch - 48;
    }
    cout << n << " ";//先输出行数
    int b = 0;//记录上一次连续相同的1或0的最后的下标
    for (int i = 0; i < n * n; i++)
    {
        if(word[0]==1&&i==0)//保证第一个是0的数量
        cout<<0<<" ";
        if (word[i] != word[i + 1])//有不同输出差值
        {
            cout << i + 1 - b << " ";
            b = i + 1;
        }
    }
    
    return 0;
}