import sys
import math
import collections


# sys.setrecursionlimit(10000001)
INF = 10 ** 20
# MOD = 10 ** 9 + 7
MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))


# ===CODE===
def main():
    s = list(input())
    cnt = collections.Counter(s)
    res = []
    for k, v in cnt.items():
        if v == 1:
            res.append(s.index(k)+1)
            res.append(k)
    print(*res)


if __name__ == '__main__':
    main()