One hundred passwords I have one hundred vaults, each one within another. Each vault has a password, consisting of a single number.


  95  43  81  89  56  89  57  67  7   45  34  34  78  88  14  40  81  23  26  78  46  8   96  11  28  3   74  6   23  89  54  37  6   99  45  1   45  87  80  12  92  20  49  72  9   92  15  76  13  3   5   32  96  87  38  87  31  10  34  8   57  73  59  33  72  95  80  84  11  4   11  11  37  71  77  91  49  21  52  48  43  11  77  52  64  3   9   21  38  65  69  84  96  78  7   71  80  78  3   97


It's too hard to memorize all these passwords, and it's not safe to keep the passwords on a piece of paper. The only solution I can think of is to use a program with exactly one hundred characters. The password to the nth vault will be found by treating the first n characters of the code as a program.

Thus, the first character of the program, if run as a program by itself, must output 95. The first two characters by themselves must output 43. The entire program must output 97.

I admit that this is really hard. So just do your best. Try to make your program work for as many vaults as possible, and I'll memorize the passwords to the rest.

Rules


If there is a tie, the winner is the earliest submission.
Standard loopholes forbidden. That includes reading from other files or from the Internet.
You have a few options for the code:

A full program which prints the correct number
A function which returns or prints it
An expression which evaluates to it (e.g. in C, 4+3 evaluates to 7)

You may assume a REPL environment
You may use different techniques for each value of n. For example, you can use different languages for each n, or sometimes use a full program and sometimes a function.


Note: This scenario is completely fictional. If you have a similar issue, do not post your passwords online.
>&lt;> (Fish), 95

Starting after the '  puts all characters onto the stack and at the end of the line it wraps around; closes the string with the same '; outputs the top of the stack as a number (n) and finish execution (;).

Characters for 13 and 10 were changed to space to not ruin the layout of the code (as fish is a 2D language.)

Some non-printable ASCII disappears in the answer. Correct program here.

'n;Y8Y9C-""NX(QN.`JY6%c--WP\1H  \LX `W&amp;WX"9I;!H_PT%GM[140+M4@   &amp;AET`NGPNa


Thanks for Martin Büttner and Sp3000 for improvements of 2 and 5 bytes.

Hex dump:

0000000: 276e 3b59 3859 3943 072d 2222 4e58 0e28  'n;Y8Y9C.-""NX.(
0000010: 5117 1a4e 2e08 600b 1c03 4a06 1759 3625  Q..N..`...J..Y6%
0000020: 0663 2d01 2d57 500c 5c14 3148 095c 0f4c  .c-.-WP.\.1H.\.L
0000030: 5803 0520 6057 2657 1f58 2208 3949 3b21  X.. `W&amp;W.X".9I;!
0000040: 485f 5054 0b04 0b0b 2547 4d5b 3115 3430  H_PT....%GM[1.40
0000050: 2b0b 4d34 4003 0915 2641 4554 604e 0747  +.M4@...&amp;AET`N.G
0000060: 504e 0361                                PN.a