import java.io.*;
import java.util.*;

public class Main{
	static long fastpow(long n,long ti,int mod) {
		 if (ti == 0) 
		        return 1l;
		if(ti%2==0) {
			long y=fastpow(n, ti/2,mod);
			long k=y*y;
			k%=mod;
			return k;
		}
		else {
			long y=fastpow(n, ti/2,mod);
			long k=((n*y)%mod)*y;
			k%=mod;
			return k;
		}
	}
	static void main() throws Exception{
		int n=sc.nextInt();
		char[]cs=sc.nextLine().toCharArray();
		int[]bits=new int[n];
		int cnt=0;
		for(int i=0;i<n;i++) {
			bits[i]=cs[i]-'0';
			cnt+=bits[i];
		}
		if(cnt==0) {
			for(int i=0;i<n;i++) {
				pw.println(1);
			}
			return;
		}
		long nummod=0,nummodG=0,nummodS=0;
		for(int i=0,pow=n-1;i<n;i++,pow--) {
			if(bits[i]==0)continue;
//			nummod=(nummod+fastpow(2, pow, cnt))%cnt;
			nummodG=(nummodG+fastpow(2, pow, cnt+1))%(cnt+1);
			if(cnt!=1)
				nummodS=(nummodS+fastpow(2, pow, cnt-1))%(cnt-1);
		}
		for(int i=0,pow=n-1;i<n;i++,pow--) {
			long curNum=0;
			int ans=1;
			if(bits[i]==0) {
				curNum=(nummodG+fastpow(2, pow, cnt+1))%(cnt+1);
				
			}
			else {
				if(cnt==1) {
					curNum=0;
					ans=0;
				}
				else
					curNum=(cnt-1+nummodS-fastpow(2, pow, cnt-1))%(cnt-1);
			}
			while(curNum>0) {
				curNum=(curNum%Long.bitCount(curNum));
				ans++;
			}
			pw.println(ans);
		}
	}
	public static void main(String[] args) throws Exception{
		pw=new PrintWriter(System.out);
		sc = new MScanner(System.in);
		int tc=1;
//		tc=sc.nextInt();
		while(tc-->0)
			main();
		pw.flush();
	}
	static PrintWriter pw;
	static MScanner  sc;
	static class MScanner {
		StringTokenizer st;
		BufferedReader br;
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int[] intArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public long[] longArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public int[] intSortedArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public long[] longSortedArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public Integer[] IntegerArr(int n) throws IOException {
	        Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public Long[] LongArr(int n) throws IOException {
	        Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
	static void shuffle(int[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			int tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
	static void shuffle(long[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			long tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
}


Measured memory_bytes: 49240