An uppercase or lowercase English letter \alpha will be given as input.
If \alpha is uppercase, print A; if it is lowercase, print a.

-----Constraints-----
 - \alpha is an uppercase (A - Z) or lowercase (a - z) English letter.

-----Input-----
Input is given from Standard Input in the following format:
α

-----Output-----
If \alpha is uppercase, print A; if it is lowercase, print a.

-----Sample Input-----
B

-----Sample Output-----
A

B is uppercase, so we should print A.

Difficulty: EASY

Solutions:
print('A' if str(input()).isupper() else 'a')


a = input()
if a.isupper() == True:
	print('A')
else:
	print('a')


S = input()
print('A' if S.isupper() else 'a')


print('aA'[input().isupper()])


a = input()
b = ord(a)
print('A' if 65 <= b <= 90 else 'a')


p = str(input())
if p.isupper() == True:
	print('A')
else:
	print('a')


x = input()
print('a' if x == x.lower() else 'A')


a = input()
print(['a', 'A'][a.isupper()])


s = input()
if s.lower() == s:
	print('a')
else:
	print('A')


alpha = input()
print('A' if alpha.isupper() else 'a')


x = input()
print('A') if x.isupper() else print('a')


alp = input()
print('A' if alp.isupper() else 'a')


s = input()
print(['A', 'a'][s.lower() == s])


S = input()
print('a' if S.lower() == S else 'A')


n = input()
if n.isupper():
	print('A')
else:
	print('a')


print(['a', 'A'][65 <= ord(input()) <= 90])


N = input()
print('A' if N.isupper() else 'a')


a = input().strip()
print('A' if a.isupper() else 'a')


alpha = input()
if alpha.isupper() == True:
	ans = 'A'
else:
	ans = 'a'
print(ans)


ch = input()
print('A' if ch.isupper() else 'a')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, bisect
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
import sys
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
stdin = sys.stdin
ni = lambda : int(ns())
nf = lambda : float(ns())
na = lambda : list(map(int, stdin.readline().split()))
nb = lambda : list(map(float, stdin.readline().split()))
ns = lambda : stdin.readline().rstrip()
a = ns()
print('A') if a.isupper() else print('a')


alp = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']
a = str(input())
if a in alp:
	print('A')
else:
	print('a')


i = input()
print(['A', 'a'][i == i.lower()])


Al = input()
if Al.isupper():
	print('A')
else:
	print('a')


s = input()
if s.isupper():
	print('A')
else:
	print('a')


temp = input()
if temp.isupper():
	print('A')
else:
	print('a')


a = input()
print('aA'[a.isupper()])


print('A' if input()[0].isupper() else 'a')


C = input()
print('A' if C.isupper() else 'a')


c = input()
print('A' if c.isupper() else 'a')


X = input()
print('A' if X.isupper() else 'a')


n = ord(input())
print('A' if 65 <= n <= 90 else 'a')


import sys
sys.setrecursionlimit(1000000)
from collections import deque
N = input()
if N.isupper():
	print('A')
else:
	print('a')


import sys, os.path
sys.setrecursionlimit(10 ** 5)

def mod():
	return 10 ** 9 + 7

def i():
	return sys.stdin.readline().strip()

def ii():
	return int(sys.stdin.readline())

def li():
	return list(sys.stdin.readline().strip())

def mii():
	return map(int, sys.stdin.readline().split())

def lii():
	return list(map(int, sys.stdin.readline().strip().split()))

def solve():
	a = i()
	if a.isupper():
		print('A')
	else:
		print('a')
for _ in range(1):
	solve()


c = input()
print(['a', 'A'][ord('A') <= ord(c) <= ord('Z')])


a = input()
print('Aa'[a == a.lower()])


char = input()
if char.isupper():
	print('A')
else:
	print('a')


al = input()
print('A' if al.isupper() else 'a')


alpha = input()
print('A' if alpha >= 'A' and alpha <= 'Z' else 'a')


print(('a', 'A')[str(input()).isupper()])


print('aA'[input().isupper()::2])


g = input()
print('a' if g.lower() == g else 'A')


c = input()
print('A' if c != c.lower() else 'a')


j = input()
if 'A' <= j and j <= 'Z':
	print('A')
else:
	print('a')