type sm_type=array [0..10000] of char;
var sm: sm_type;
st:string;
i,n,is,si: integer;

begin

n:=1;
While n<>0 do begin
  Write('>');
  readln(n);
case n of
0: exit end;

for i:=1 to n do begin
str(i, st);
 for is:=1 to length(st) do begin si:=si+1;
 sm[si]:=st[is] end;

end;
Writeln('Number ',n,'= ',sm[n]);
Writeln;
end;
end.

for i:=1 to n do begin
str(i, st);
for is:=1 to length(st) do begin si:=si+1;
sm[si]:=st[is] end;

Function Power(a, x: LongInt): LongInt;
 Begin
   Power := Trunc( Exp(x * Ln(a)) )
 End;

Const
 n: Integer = {110}  (* result = 6 *)
              {18}   (* result = 1 *)
              19   (* result = 4 *)
              {1992} (* result = 0 *)
              {100}  (* result = 5 *)
              {201}  (* result = 3 *)
              {215}  (* result = 6 *)
              {621}  (* result = 3 *)
              {154}  (* result = 8 *)
            ;
Var
 TPower, nPrev: Integer;
 i, nCount, nPosIn: Integer;
 Decr: Integer;
 s: String;
Begin
 TPower := 0; nPrev := n;
 Repeat
   Inc(TPower);
   Decr := 9 * TPower * Power(10, Pred(TPower));
   n := n - Decr;
 Until n < 0;
 n := n + Decr;

 nCount := (n div TPower) + (n mod TPower);
 Dec(TPower);
 For i := 1 To TPower do
   Inc( nCount, 9 * Power(10, Pred(i)) );
 nPosIn := Succ(TPower) - (n mod Succ(TPower));

 Str(nCount, s);
 WriteLn('Digit #', nPrev, ' = ', s[nPosIn])
End.