#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
	#define DEBUG_OUTPUT_ENABLED 1
	#define DBG(X) dout << #X << "=" << (X) << '\n';
	#define SAY(X) dout << (X) << '\n';
#else
	#define DEBUG_OUTPUT_ENABLED 0
	#define DBG(X) 42;
	#define SAY(X) 42;
#endif

#define dout   debug::instance

using namespace std;

template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }
namespace debug {
	struct DebugStream {
		private:
			bool is_first;
		public:
			DebugStream(bool _is_first): is_first(_is_first) {}
			template<typename T> DebugStream operator<<(const T& value) const {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				cout << value;
				return DebugStream(false);
			};

			template<typename T> DebugStream printArray(T* l, T* r) {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				while(l != r) {
					cout << (*l);
					++l;
					if(l == r) {
						cout << '\n';
					} else {
						cout << ' ';
					}
				}
				return DebugStream(false);
			}
	};
	DebugStream instance(true);
};

using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for(auto& elem: ret) cin >> elem; return ret; }
const int MAXN = (int)1e5 + 7;
vector<int> G[MAXN];
int n, a[MAXN], b[MAXN], dp[MAXN];
void fail() {
	cout << "-1\n";
	exit(0);
}
void dfs(int v, int prv) {
	dp[v] = 1;
	for(auto& u: G[v]) if(u != prv) {
		dfs(u, v);
		dp[v] += dp[u];
	}
	if(prv != NIL) {
		b[dp[v]] = 1;
		b[n - dp[v]] = 1;
	}
}
void solve() {
	{
		auto S = fetch<string>();
		n = len(S);
		for(int i = 1; i <= n; ++i) a[i] = S[i - 1] - '0';
	}
	vector<int> szs = {n};
	for(int i = 1; i <= n; ++i) if(a[i]) szs.emplace_back(min(i, n - i));
	sort(szs.begin(), szs.end());
	szs.erase(unique(szs.begin(), szs.end()), szs.end());
	DBG(szs);
	int root = NIL, last = 0, curSz = 0;
	for(int i = 0; i < len(szs); ++i) {
		int nRoot = last++;
		if(root != NIL) G[nRoot].emplace_back(root);
		root = nRoot;
		++curSz;
		if(curSz > szs[i]) fail();
		while(curSz != szs[i]) {
			int nLeaf = last++;
			G[root].emplace_back(nLeaf);
			++curSz;
		}
	}
	if(last != n || root == NIL) fail();
	dfs(root, NIL);
	for(int i = 0; i <= n; ++i) if(a[i] != b[i]) fail();
	for(int v = 0; v < n; ++v) for(auto& u: G[v]) cout << v + 1 << ' ' << u + 1 << '\n';
}

int main() {
	fast_io();
	solve();

	return 0;
}


Measured memory_bytes: 9704