Problem: You are given a 4x4 grid. You play a game — there is a sequence of tiles, each of them is either 2x1 or 1x2. Your task is to consequently place all tiles from the given sequence in the grid. When tile is placed, each cell which is located in fully occupied row or column is deleted (cells are deleted at the same time independently). You can place tile in the grid at any position, the only condition is that tiles (and tile parts) should not overlap. Your goal is to proceed all given figures and avoid crossing at any time.

Input

The only line contains a string s consisting of zeroes and ones (1 ≤ |s| ≤ 1000). Zero describes vertical tile, one describes horizontal tile.

Output

Output |s| lines — for each tile you should output two positive integers r,c, not exceeding 4, representing numbers of smallest row and column intersecting with it.

If there exist multiple solutions, print any of them.

Example

Input


010


Output


1 1
1 2
1 4

Note

Following image illustrates the example after placing all three tiles: 

<image> Then the first row is deleted:  <image>

Solution (in JAVA):

Solution:
	                                                    import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.TreeMap;


	                 
	                 
	                 
	                 
	                 
	                public class Solution2 implements Runnable
	                {
	                    static final long MAX = 464897L;
	                    static class InputReader
	                    {
	                        private InputStream stream;
	                        private byte[] buf = new byte[1024];
	                        private int curChar;
	                        private int numChars;
	                        private SpaceCharFilter filter;
	                        private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	                 
	                        public InputReader(InputStream stream)
	                        {
	                            this.stream = stream;
	                        }
	                        
	                        public int read()
	                        {
	                            if (numChars==-1) 
	                                throw new InputMismatchException();
	                            
	                            if (curChar >= numChars)
	                            {
	                                curChar = 0;
	                                try 
	                                {
	                                    numChars = stream.read(buf);
	                                }
	                                catch (IOException e)
	                                {
	                                    throw new InputMismatchException();
	                                }
	                                
	                                if(numChars <= 0)                
	                                    return -1;
	                            }
	                            return buf[curChar++];
	                        }
	                     
	                        public String nextLine()
	                        {
	                            String str = "";
	                            try
	                            {
	                                str = br.readLine();
	                            }
	                            catch (IOException e)
	                            {
	                                e.printStackTrace();
	                            }
	                            return str;
	                        }
	                        public int nextInt()
	                        {
	                            int c = read();
	                            
	                            while(isSpaceChar(c)) 
	                                c = read();
	                            
	                            int sgn = 1;
	                            
	                            if (c == '-') 
	                            {
	                                sgn = -1;
	                                c = read();
	                            }
	                            
	                            int res = 0;
	                            do 
	                            {
	                                if(c<'0'||c>'9') 
	                                    throw new InputMismatchException();
	                                res *= 10;
	                                res += c - '0';
	                                c = read();
	                            }
	                            while (!isSpaceChar(c)); 
	                            
	                            return res * sgn;
	                        }
	                        
	                        public long nextLong() 
	                        {
	                            int c = read();
	                            while (isSpaceChar(c))
	                                c = read();
	                            int sgn = 1;
	                            if (c == '-') 
	                            {
	                                sgn = -1;
	                                c = read();
	                            }
	                            long res = 0;
	                            
	                            do 
	                            {
	                                if (c < '0' || c > '9')
	                                    throw new InputMismatchException();
	                                res *= 10;
	                                res += c - '0';
	                                c = read();
	                            }
	                            while (!isSpaceChar(c));
	                                return res * sgn;
	                        }
	                        
	                        public double nextDouble() 
	                        {
	                            int c = read();
	                            while (isSpaceChar(c))
	                                c = read();
	                            int sgn = 1;
	                            if (c == '-') 
	                            {
	                                sgn = -1;
	                                c = read();
	                            }
	                            double res = 0;
	                            while (!isSpaceChar(c) && c != '.') 
	                            {
	                                if (c == 'e' || c == 'E')
	                                    return res * Math.pow(10, nextInt());
	                                if (c < '0' || c > '9')
	                                    throw new InputMismatchException();
	                                res *= 10;
	                                res += c - '0';
	                                c = read();
	                            }
	                            if (c == '.') 
	                            {
	                                c = read();
	                                double m = 1;
	                                while (!isSpaceChar(c)) 
	                                {
	                                    if (c == 'e' || c == 'E')
	                                        return res * Math.pow(10, nextInt());
	                                    if (c < '0' || c > '9')
	                                        throw new InputMismatchException();
	                                    m /= 10;
	                                    res += (c - '0') * m;
	                                    c = read();
	                                }
	                            }
	                            return res * sgn;
	                        }
	                        
	                        public String readString() 
	                        {
	                            int c = read();
	                            while (isSpaceChar(c))
	                                c = read();
	                            StringBuilder res = new StringBuilder();
	                            do 
	                            {
	                                res.appendCodePoint(c);
	                                c = read();
	                            } 
	                            while (!isSpaceChar(c));
	                            
	                            return res.toString();
	                        }
	                     
	                        public boolean isSpaceChar(int c) 
	                        {
	                            if (filter != null)
	                                return filter.isSpaceChar(c);
	                            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	                        }
	                     
	                        public String next() 
	                        {
	                            return readString();
	                        }
	                        
	                        public interface SpaceCharFilter 
	                        {
	                            public boolean isSpaceChar(int ch);
	                        }
	                    }
	                     
	                    public static void main(String args[]) throws Exception
	                    {
	                        new Thread(null, new Solution2(),"Solution2",1<<26).start();
	                    }   
	                    static long gcd(long a, long b) 
	                    { 
	                      if (b == 0) 
	                        return a; 
	                      return gcd(b, a % b);  
	                    } 
	                    static long lcm(long a,long b) {
	                        return (a*b)/gcd(a,b);
	                    }
	                    int maxn = 1000005;
	                    long MOD = 998244353;
	                    long prime = 29;
	                    ArrayList<Integer> adj[];
	                    TreeMap<Long,Long> tmap = new TreeMap();
	                    int[] val;
	                    int[] ans;
	                    public void run() 
	                    {
	                        InputReader sc = new InputReader(System.in);
	                        PrintWriter w = new PrintWriter(System.out);
	                        String s = sc.next();
	                        boolean one = false;
	                        boolean two = false;
	                        for(int i = 0;i < s.length();i++) {
	                        	if(s.charAt(i) == '0') {
	                        		if(one) {
	                        			w.println("1 1");
	                        			one = false;
	                        		}else {
	                        			w.println("3 1");
	                        			one = true;
	                        		}
	                        	}else {
	                        		if(two) {
	                        			w.println("2 1");
	                        			two = false;
	                        		}else {
	                        			w.println("2 3");
	                        			two = true;
	                        		}
	                        	}
	                        }
	                        w.close();
	                    } 
	                    String forward(String s) {
	                    	char[] ch = s.toCharArray();
	                    	char[] toSend = new char[s.length()];
	                    	int x = 0;
	                    	for(int i = 0;i < ch.length;i+=2) {
	                    		toSend[x] = ch[i];
	                    		x++;
	                    	}
	                    	int y = ch.length-1;
	                    	for(int i = 1;i < ch.length;i+=2) {
	                    		toSend[y] = ch[i];
	                    		y--;
	                    	}
	                    	return String.valueOf(toSend);
	                    }
	                    String formed(String s) {
	                    	char[] ch = s.toCharArray();
	                    	char[] toSend = new char[s.length()];
	                    	int x = ch.length-1;
	                    	int y = 0;
	                    	for(int i = 0;i < ch.length/2;i++) {
	                    		toSend[y] = ch[i];
	                    		if(i+1<ch.length) {
	                    			toSend[y+1] = ch[x];
	                    			x--;
	                    		}
	                    		y+=2;	
	                    	}
	                    	return String.valueOf(toSend);
	                    }
	                    long ans(long r,long v) {
	                    	if(r == 0) {
	                    		return 0L;
	                    	}
	                    	int[] prefix = new int[64];
                        	for(long i = 0;i <= 63;i++) {
                        		if((v>>i&1L) != 0) {
                        			if(i == 0) {
                        				prefix[(int) i] = 1;
                        			}else {
                        				prefix[(int) i] = prefix[(int) (i-1)] + 1;
                        			}
                        		}else {
                        			if(i == 0) {
                        				continue;
                        			}
                        			prefix[(int) i] = prefix[(int) (i-1)];
                        		}
                        	}
                        	
                        	long ans = 0;
                        	for(long i = 63;i > 0;i--) {
                        		if((v>>i & 1L) != 0) {
                        			if((r>>i&1L) == 0) {
                        				return ans;
                        			}
                        		}
                        		else if(((r>>i)&1L) != 0) {
                        			r = r - (1L<<i);
                        			long cnt = prefix[(int) (i-1)];
                        			long todd = i - cnt;
                        			ans += pow2[(int) todd];
                        			r = r + (1L<<i);
                        		}
                        		
                        	}
                        	return ans+1;
	                    }
	                    long[] pow2 = new long[64];
	                    void pre() {
	                    	pow2[0] = 1;
	                    	for(int i = 1;i <= 63;i++) {
	                    		pow2[i] = pow2[i-1] * 2;
	                    	}
	                    }
	                    ArrayList<Integer> merge(int key,ArrayList<Integer> a,ArrayList<Integer> b){
	                		ArrayList<Integer> c = new ArrayList();
	                		int i = 0;
	                		int j = 0;
	                		while(i < a.size() && j < b.size()){
	                			if(a.get(i) <= b.get(j)){
	                				c.add(a.get(i));
	                				i++;
	                			}else{
	                				c.add(b.get(j));
	                				j++;
	                			}
	                		}
	                		while(i < a.size()){
	                			c.add(a.get(i));
	                			i++;
	                		}
	                		while(j < b.size()){
	                			c.add(b.get(j));
	                			j++;
	                		}
	                		
	                		ArrayList<Integer> toreturn = new ArrayList();
	                		for(int l = 0;l < c.size();l+=2) {
	                			toreturn.add(c.get(l));
	                		}
	                		if(c.size() % 2 != 0) {
	                			toreturn.remove(toreturn.size()-1);
	                		}
	                		ans[c.get(c.size()-1)] = key;
	                		return toreturn;
	                	}
	                    static class SegTreeLazy{
	                		long[] segTree;
	                		long[] lazy;
	                		public SegTreeLazy(int n){
	                			segTree = new long[4*n];
	                			lazy = new long[4*n];
	                		}
	                		void build(int l,int r,int pos,int[] arr) {
	                			if(l == r) {
	                				segTree[pos] = arr[l];
	                				return;
	                			}
	                			int mid = (l + r)/2;
	                			build(l, mid, 2*pos+1, arr);
	                			build(mid+1, r, 2*pos+2, arr);
	                			segTree[pos] = segTree[2*pos+1] + segTree[2*pos+2];
	                		}
	                		void update(int l,int r,int start,int end,int pos,long val) {
	                			
	                			if(lazy[pos] != 0) {
	                				segTree[pos] += (r - l + 1) * lazy[pos];
	                				if(l != r) {
	                					lazy[2*pos+1] += lazy[pos];
	                					lazy[2*pos+2] += lazy[pos];
	                				}
	                				lazy[pos] = 0;
	                			}
	                			if(l > r || l > end || r < start) {
	                				return;
	                			}
	                			if(l >= start && r <= end) {
	                				segTree[pos] += (r - l + 1) * val;
	                				if(l != r) {
	                					lazy[2*pos+1] += val;
	                					lazy[2*pos+2] += val;
	                				}
	                				return;
	                			}
	                			int mid = (l + r)/2;
	                			update(l, mid, start, end, 2*pos+1, val);
	                			update(mid+1, r, start, end, 2*pos+2, val);
	                			segTree[pos] = segTree[2*pos+1] + segTree[2*pos+2];
	                		}
	                		long query(int l,int r,int start,int end,int pos) {
	                			if(lazy[pos] != 0) {
	                				segTree[pos] += (r - l + 1) * lazy[pos];
	                				if(l != r) {
	                					lazy[2*pos+1] += lazy[pos];
	                					lazy[2*pos+2] += lazy[pos];
	                				}
	                				lazy[pos] = 0;
	                			}
	                			if(l > r || l > end || r < start) {
	                				return 0;
	                			}
	                			if(l >= start && r <= end) {
	                				return segTree[pos];
	                			}
	                			int mid = (l + r)/2;
	                			long p1 = query(l, mid, start, end, 2*pos+1);
	                			long p2 = query(mid+1, r, start, end, 2*pos+2);
	                			return p1 + p2;
	                		}
	                	}
	                	
	                    static long power(long a,long b,long mod) {
                            long ans = 1;
                            a = a % mod;
                            while(b != 0) {
                                if(b % 2 == 1) {
                                    ans = (ans * a) % mod;
                                }
                                a = (a * a) % mod;
                                b = b/2;
                            }
                            return ans;
                        }
	                    class Pair implements Comparable<Pair>{
	                        int a;
	                        int b;
	                        int c;
	                        Pair(int a,int b,int c){
	                            this.b = b;
	                            this.a = a;
	                            this.c = c;
	                        }
	                        public boolean equals(Object o) {
	                            Pair p = (Pair)o;
	                            return this.a == p.a && this.b == this.b;
	                        }
	                        public int hashCode(){
	                            return Long.hashCode(a)*27 + Long.hashCode(b)*31;
	                        }
	                        public int compareTo(Pair p) {
	                            return Long.compare(this.a,p.a);
	                        }
	                    }
	                    
	                }