#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    string s;
    cin >> s;
    unordered_map<char, int32_t> mp;
    for (auto c : s) {
        ++mp[c];
    }
    for (auto &&p : mp) {
        if (p.second == 1) {
            cout << s.find(p.first) + 1 << " " << p.first << endl;
        }
    }
    return 0;
}