avamsi

mod = 1000000007
pre = [1]
for _ in xrange(100000):
	pre.append(2*pre[-1] % mod)
for t in xrange(1, int(raw_input()) + 1):
	n = int(raw_input()) - 1
	if n:
		print 'Case {0}: {1}'.format(t, (n + 2)*pre[n - 1] % mod)
	else:
		print 'Case {0}: 1'.format(t)

avamsi

++++++++++
[
>+++++++[>+++++++<-]
>-
>,
>,,
<[>-<-]
>>+
<[>-]
>[>]

avamsi

++++[>++++<-]>[>+++++>++>++++++>+++++++<<<<-]
>+++.
---.
-.
-----.
>.
>+++++++++.
>+++.
<<.
>.

avamsi

while True:
	out = raw_input()
	if int(out) is 42:
		break
	print out

avamsi

def common(a, b):
	out = []
	for i in a:
		try:
			b.remove(i)
			out.append(i)
		except ValueError:
			pass
	return sorted(out)
while True:

avamsi

f = []
ff = set([])
for _ in xrange(int(raw_input())):
	i = raw_input().split()
	f.append(i[0])
	ff = ff.union(set(i[2: ]))
for i in f:
	try:
		ff.remove(i)
	except KeyError:

avamsi

#include <iostream>
using namespace std;
int abs(int n)
{
	if (n < 0)
		return -1 * n;
	else
		return n;
}
int main()

avamsi

fact = [1]
for i in xrange(1, 101):
	fact.append(i * fact[i - 1])
for _ in xrange(int(raw_input())):
	print fact[int(raw_input())]

avamsi

#include <iostream>
using namespace std;
int main()
{
	int t, fact[200], n, i, j, carry, m, x;
	cin >> t;
	while (t--)
	{
		cin >> n;
		fact[0] = 1;

avamsi

from math import log
try:
	while True:
		print int(log(int(raw_input()), 2))
except ValueError:
	pass