#!/usr/bin/python
from math import log

prime_count = lambda x : x / log(x)
bins = [0] * 10

for power in range(1, 8):
    for bin in range(1, 10):
        bins[bin] += prime_count((bin+1)*(10**power)) - (prime_count(bin*(10**power)) if bin > 0 else 0)

total = sum(bins)

for i, count in enumerate(bins):
    print i, count/total
