/*
 * @(#) msu96_a.c - Problem 'A' ("Sequence of 13 ones") solution
 * of the ACM Programming Contest at the MSU in 1996.
 * (c) 1996 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1996-11-25 18:30:00 GMT+03:00
 */

/* Input data file: a.dat */

#include <stdio.h>

long c[32][32];

int main()
{
 int i,j;
 long n,k;
 char ch;
 int first=1;
 FILE *f=fopen("a.dat","rt");
 for (i=0;i<32;i++)
 {
  c[i][0]=c[i][i]=1;
  for (j=1;j<i;j++)
   c[i][j]=c[i-1][j-1]+c[i-1][j];
 }
 for (;;)
 {
  n=0;
  for (;;)
  {
   if ((ch=getc(f))==EOF)
    ch='#';
   if (ch!='0' && ch!='1')
    break;
   n<<=1;
   if (ch=='1')
    n++;
  }
  if (ch=='#')
   break;
  k=1;
  for (i=0;i<13;i++)
   if (n & 1)
    n>>=1;
    else
    {
     n>>=1;
     break;
    }
  j=i+1;
  while (n && i<13)
  {
   if (n & 1)
    k+=c[j][++i];
   n>>=1;
   j++;
  }
  if (n || i<13)
   k=0;
  if (!first)
   printf(" ");
  first=0;
  printf("%ld",k);
 }
 printf("\n");
 return 0;
}