// Arup Guha
// 10/18/2013
// Solution to 2008 MCPC Problem A: Parity

import java.util.*;

public class a {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		String s = stdin.next();

		// Process each case.
		while (!s.equals("#")) {

			// Separate out bits.
			char[] bits = s.substring(0, s.length()-1).toCharArray();

			// Get parity.
			int parity = 0;
			if (s.charAt(s.length()-1) == 'o')
				parity = 1;

			// Get current parity.
			int cnt = 0;
			for (int i=0; i<bits.length; i++)
				if (bits[i] == '1')
					cnt = (cnt+1)%2;

			// Print original string.
			System.out.print(new String(bits));

			// Add parity bit.
			if (cnt == parity)
				System.out.println("0");
			else
				System.out.println("1");

			// Go to the next case.
			s = stdin.next();
		}
	}
}