You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?

* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th character in s is `1`, we can have a connected component of size i by removing one edge from the tree.
* If the i-th character in s is `0`, we cannot have a connected component of size i by removing any one edge from the tree.



If such a tree exists, construct one such tree.

Constraints

* 2 \leq n \leq 10^5
* s is a string of length n consisting of `0` and `1`.

Input

Input is given from Standard Input in the following format:


s


Output

If a tree with n vertices that satisfies the conditions does not exist, print `-1`.

If a tree with n vertices that satisfies the conditions exist, print n-1 lines. The i-th line should contain u_i and v_i with a space in between. If there are multiple trees that satisfy the conditions, any such tree will be accepted.

Examples

Input

1111


Output

-1


Input

1110


Output

1 2
2 3
3 4


Input

1010


Output

1 2
1 3
1 4
import sys
import socket

if socket.gethostname() in ['N551J', 'F551C']:
    sys.stdin = open('e1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_int():
    return int(input())


def read_str_list():
    return input().split()


def read_str():
    return input()


def solve():
    s = list(map(int, read_str()))
    n = len(s)
    if s[0] != 1:
        return -1
    if s[n - 1] != 0:
        return -1
    for i in range(n - 1):
        if s[i] != s[n - 2 - i]:
            return -1
    x = [i for i in range(n) if s[i] == 1]
    k = len(x)
    body = list(range(1, k + 2))
    res = [[body[i], body[i + 1]] for i in range(k)]
    p = k + 2
    for j in range(1, k):
        for l in range(x[j] - x[j-1] - 1):
            edge = [body[j], p]
            p += 1
            res.append(edge)
    return res


def main():
    res = solve()
    if res == -1:
        print(res)
        return
    for edge in res:
        print(*edge)


if __name__ == '__main__':
    main()
