Problem:
 Score : 100 points    Problem Statement 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 1 B      Sample Output 1 A  B is uppercase, so we should print A .       Sample Input 2 a      Sample Output 2 a  a is lowercase, so we should print a .

Solution (Python):
a = input()

if 65 <= ord(a) <= 90:
    print("A")
else:
    print("a")

Solution (Python):
print('A' if input().isupper() else 'a')

Solution (Python):
a=input()

if a.isupper():
    print("A")
else:
    print("a")

Solution (Python):
alpha = str(input())
if alpha.isupper():
    print("A")
else:
    print("a")

Solution (Python):
A = input()
if A.islower():
    print("a")
else:
    print("A")

Solution (Python):
a=input()
if a==a.upper():
  print("A")
else:
  print("a")

Solution (Python):
string = input()

ans = 'a'
if string.isupper():
    ans = 'A'

print(ans)

Solution (Python):
X = input()

if X.isupper():
    print('A')
else:
    print('a')

Solution (Python):

s = input()
if s == s.upper():
    print("A")
else:
    print("a")

Solution (Python):
c = input()
if c.lower() == c:
    print('a')
else:
    print('A')

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007




def main():
	S = inputStr()

	if S.isupper() == True:
		print("A")
	else:
		print("a")




if __name__ == "__main__":
	main()

Solution (Python):
a = input()

if a.isupper() == True:
  print('A')
elif a.islower() == True:
  print('a')

Solution (Python):
print("A" if input().isupper() else "a")

Solution (Python):
s=input()
c=s.isupper()
if c==True:
  print("A")
else:
  print("a")

Solution (Python):
alpha = input()


if alpha.isupper():
    print('A')
    
if alpha.islower():
    print('a')

Solution (Python):
print("A" if input().isupper()==True else "a")

Solution (Python):
n=input()
if n>='a':print('a')
else:print('A')

Solution (Python):
def main():
    s: str = input()

    if s.isupper():
        print("A")
    else:
        print("a")


if __name__ == "__main__":
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


def main():
    a = input()
    if a.islower():
        print("a")
    else:
        print("A")


if __name__ == "__main__":
    main()

Solution (Python):

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

Solution (Python):
a = input()
print('A' if a.lower() != a else 'a')

Solution (Python):
S=input()
if "A"<=S<="Z":
  print("A")
else:
  print("a")

Solution (Python):
a = input()

if a.isupper():
    print('A')
else:
    print('a')

Solution (Python):
a = input()
print('a' if a.islower() else 'A')

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

s = input()

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

Solution (Python):
a = input()

if a.isupper():
    print("A")
elif a.islower():
    print("a")

Solution (Python):
en2asc = lambda s: ord(s) - 97
print('A' if en2asc(input()) < 0 else 'a')

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

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

Solution (Python):
a = input()
if a.isupper():
    print('A')

else:
    print('a')

Solution (Python):
a = input()
if a.islower():
  print('a')
elif a.isupper():
  print('A')

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

Solution (Python):
print("A") if input().isupper() else print("a")

Solution (Python):
alpha = input()
if alpha.upper()==alpha:
    print("A")
elif alpha.lower()==alpha:
    print("a")

Solution (Python):
alpha = input()
if alpha.isupper():
    print("A")
elif alpha.islower:
    print("a")

Solution (Python):
L=list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
s=str(input())
if s in L:
    print('A')
else:
    print('a')

Solution (Python):
b = input()

if b == b.lower():
    print("a")
else:
    print("A")

Solution (Python):
a = input()
if a.islower():
  print('a')
else:
  print('A')

Solution (Python):
s = input()
if s.upper() == s:
  print("A")
else:
  print("a")

Solution (Python):
a=input()
if a>='a' and a <='z':
    print("a")
else:
    print("A")

Solution (Python):
import sys

x = input()
if ord(x) < 91:
    print('A')
else:
    print('a')

Solution (Python):
a = input()

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

Solution (Python):
x = input()
print('A' if x.upper() == x else 'a')

Solution (Python):
a = input()

if a.isupper():
	print("A")
elif a.islower():
	print("a")

Solution (Python):
a = input()
if a.isupper():
  print("A")
else:
  print("a")

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

Solution (Python):



x = input()


def main():
    if x.islower():
        ans = "a"
    else:
        ans = "A"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import sys


def log(s):
    
    pass


def output(x):
    print(x, flush=True)


def input_ints():
    return list(map(int, input().split()))


def main():
    t = input()
    print("A" if t.isupper() else "a")


main()

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

Solution (Python):
x = input()
if x.isupper():
    print("A")
else:
    print("a")

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

Solution (Python):
print('a' if input().islower() else 'A')

Solution (Python):
 

from collections import defaultdict

import sys, math
f = None
try:
	f = open('q1.input', 'r')
except IOError:
	f = sys.stdin
if 'xrange' in dir(__builtins__):
	range = xrange

sys.setrecursionlimit(10**2)

	
def print_case_iterable(case_num, iterable):
	print("Case 

def print_case_number(case_num, iterable):
	print("Case 

def print_iterable(A):
	print (' '.join(A))

def read_int():
	return int(f.readline().strip())
def read_int_array():
	return [int(x) for x in f.readline().strip().split(" ")]
def rns():
	a =  [x for x in f.readline().split(" ")]
	return int(a[0]), a[1].strip()
def read_string():
	return list(f.readline().strip())
def ri():
	return int(f.readline().strip())
def ria():
	return [int(x) for x in f.readline().strip().split(" ")]
def rns():
	a =  [x for x in f.readline().split(" ")]
	return int(a[0]), a[1].strip()
def rs():
	return list(f.readline().strip())
def bi(x):
	return bin(x)[2:]





from collections import deque
import math

NUMBER = 998244353
def factorial(n) : 
	M = NUMBER
	f = 1
  
	for i in range(1, n + 1):  
		f = (f * i) % M 
						
	return f
def mult(a,b):
	return (a * b) % NUMBER

def minus(a , b):
	return (a - b) % NUMBER

def plus(a , b):
	return (a + b) % NUMBER

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		g, y, x = egcd(b % a, a)
		return (g, x - (b // a) * y, y)

def modinv(a):
	m = NUMBER
	g, x, y = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m
def choose(n,k):
	if n < k:
		assert false
	return  mult(factorial(n), modinv(mult(factorial(k),factorial(n-k))))
from collections import deque, defaultdict 
import heapq


from types import GeneratorType
def bootstrap(f, stack=[]):
	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to

	return wrappedfunc


def dfs(g, timeIn, timeOut,depths,parents): 
	
	cnt = 0
	
	stack = [[1,0,0,0]]
	while stack:
		v,neig_i,parent,depth = stack[-1]
		parents[v] = parent
		depths[v] = depth
		
		if neig_i == 0:
			timeIn[v] = cnt    
			cnt+=1
		while neig_i < len(g[v]):
			u = g[v][neig_i]
			if u == parent:
				neig_i+=1
				continue
			stack[-1][1] = neig_i + 1
			stack.append([u,0,v,depth+1])
			break
		if neig_i == len(g[v]):
			stack.pop()
			timeOut[v] = cnt
			cnt += 1
  
def isAncestor(u: int, v: int, timeIn: list, timeOut: list) -> str: 
	return timeIn[u] <= timeIn[v] and timeOut[v] <= timeOut[u] 

cnt = 0
@bootstrap
def dfs(v,adj,timeIn, timeOut,depths,parents,parent=0,depth=0):
	global cnt
	parents[v] = parent
	depths[v] = depth
	timeIn[v] = cnt
	cnt+=1
	for u in adj[v]:
		if u == parent:
			continue
		yield dfs(u,adj,timeIn,timeOut,depths,parents,v,depth+1)
	timeOut[v] = cnt
	cnt+=1
	yield 


def solution(s):
	return 'a' if ord(s[0])>=ord('a') else 'A'



	
def main():
	T = 1
	
	for i in range(T):
		s = rs()
		
		
		

		x = solution(s)
		if 'xrange' not in dir(__builtins__):
			print(x)
		else:
			print >>output,str(x)
	if 'xrange' in dir(__builtins__):
		print(output.getvalue())
		output.close()

if 'xrange' in dir(__builtins__):
	import cStringIO
	output = cStringIO.StringIO()




if __name__ == '__main__':
	main()

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

Solution (Python):
x = input()
print("A" if x == x.upper() else "a")

Solution (Python):
ch = input().strip()

if ch.isupper():
  print("A")
else:
  print("a")

Solution (Python):
alfa = input()
if alfa.isupper():
  print('A')
else:
  print('a')

Solution (Python):
a = str(input())
if str.isupper(a):
  print("A")
else:
  print("a")

Solution (Python):

a=input()





b = a.upper()
if a == b:
    print('A')
else:
    print('a')

Solution (Python):
a = input()
if a.islower():
  print('a')
else:
  print('A')

Solution (Python):
print('A' if input().isupper() else 'a')

Solution (Python):
i = input() 
print(["A", "a"][i==i.lower()])

Solution (Python):
import re
s = input().strip()
if re.match("[a-z]", s):
    print('a')
else:
    print('A')

Solution (Python):
s = input()

if s == s.upper():
    print("A")
else:
    print("a")

Solution (Python):
st = str(input())

if st.isupper():
    print('A')
else:
    print('a')

Solution (Python):
print('a' if (input().islower()) else 'A')

Solution (Python):
x = input()

if x == x.upper():
    print("A")
else:
    print("a")

Solution (Python):
c = input()
if c.islower():
    print('a')
else:
    print('A')

Solution (Python):
print('Aa'[input()>'Z'])

Solution (Python):
print('Aa'[input()>'Z'])

Solution (Python):

def main():
    a = input().rstrip()
    print("A" if a.isupper() else "a")


if __name__ == "__main__":
    main()

Solution (Python):
s=str(input())
if s.isupper():
    print("A")
else:
    print("a")

Solution (Python):
lower = [chr(i) for i in range(97, 97+26)]
lower_dict = {l:"a" for l in lower}
upper = [chr(i) for i in range(65, 65+26)]
upper_dict = {u:"A" for u in upper}
all_dict= {**lower_dict, **upper_dict}

print(all_dict[input()])

Solution (Python):
print('A'if ord(input())<97 else'a')

Solution (Python):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
import math

rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')

def main():
	c = rll()[0]
	if 0 <= ord(c)-97 <= 25:
		print("a")
	else:
		print("A")
	stdout.close()

if __name__ == "__main__":
	main()

Solution (Python):
c= str(input())
if(c.islower()):print('a')
else:print('A')

Solution (Python):
a = input()

if a.isupper():
    print('A')
else:
    print('a')

Solution (Python):
a = str(input())
b = a.islower()
print("a" if b == True else "A")

Solution (Python):
s = str(input())
if ord(s) >= 97 and ord(s) <= 122:
    print("a")
else:
    print("A")

Solution (Python):
s=input()
if(s.islower()):
  print("a")
else:
  print("A")

Solution (Python):
print("a" if input().islower() else "A")

Solution (Python):
s = input()

if(s in "abcdefghijklmnopqrstuvwxyz"):
  print("a")
else:
  print("A")

Solution (Python):
s=input()
if s==s.upper():
    print('A')
else:
    print('a')

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

Solution (Python):
print("aA"[input().isupper()])

Solution (Python):
c = input()
if c.upper() == c:
    print("A")
else:
    print("a")

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

Solution (Python):
print("aA"[input().isupper()])

Solution (Python):
nb = input()
if nb.islower():
  print("a")
else:
  print("A")

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

Solution (Python):
char = input()
if char.islower():
  print('a')
else:
  print('A')

Solution (Python):
s = input()
if 'a' <= s <= 'z':
    print('a')
else:
    print('A')

Solution (Python):
a=str(input())

if a.isupper()==True:
  print("A")

else:
  print("a")

Solution (Python):
str = input()
print('a' if str.islower() else 'A')

Solution (Python):
a = input()
if a == a.lower():
  print("a")
  quit()

print("A")

Solution (Python):
print("A"if input().isupper()else"a")

Solution (Python):


print(['A','a'][input().islower()])

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

Solution (Python):
a = input()
lettres = "abcdefghijklmnopqrstuvwxyz"
if a in "abcdefghijklmnopqrstuvwxyz":
    print("a")
elif a in lettres.upper():
    print("A")

Solution (Python):

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

Solution (Python):
s=input()
if s==s.upper():
    print("A\n")
else:
    print("a\n")

Solution (Python):
print('A' if input().isupper() else 'a')

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

A = ord(input()[0])

print("A" if ord("A") <= A <= ord("Z") else "a")

Solution (Python):
n=input()

if ord(n)>90:
    print("a")
else:
    print("A")

Solution (Python):
s = input()

if s.upper()==s:
    print("A")
else:
    print("a")

Solution (Python):
print('aA'[input()<'a'])

Solution (Python):
A = input()

if A.isupper():
    print('A')
else:
    print('a')

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

Solution (Python):
def solve():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")

def main():
    solve()
 
 
if __name__ == "__main__":
    main()

Solution (Python):
if 97 <= ord(str(input())) <= 122:
    print("a")
else:
    print("A")

Solution (Python):
A = input()

print("A" if A.isupper() else "a")

Solution (Python):


def main():
    s = input()
    L = [chr(ord("A")+i) for i in range(26)]
    if s in L:
        print("A")
    else:
        print("a")


if __name__ == '__main__':
    main()

Solution (Python):
str=input()

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

Solution (Python):
s=input()
if ord(s)-97>=0:
    print('a')
else: print('A')

Solution (Python):
a = input()
if a.islower():
  print("a")
else:
  print("A")

Solution (Python):
print(['a', 'A'][input().isupper()])

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

Solution (Python):
a = str(input())
print('a' if a.islower() else 'A')

Solution (Python):
check='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
s=input()
if s in check:
  print('A')
else:
  print('a')

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



a = str(input())

if a.upper() == a:
    print('A')
else:
    print('a')

Solution (Python):
s = input()
if s.isupper():
  print("A")
else:
  print("a")

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

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

Solution (Python):
print('A' if input().isupper() else 'a')

Solution (Python):
a = input()
print("A" if a.isupper() else "a")

Solution (Python):
a=input()
if a==a.upper():
  print('A')
else:
  print('a')

Solution (Python):
s = input()
if 0 <= ord(s) - ord('A') <= 25:
  print('A')
else:
  print('a')

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

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

Solution (Python):
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Solution (Python):
D=input()
if str.isupper(D):
	print("A")
else:
	print("a")

Solution (Python):
n=input()
if n.islower(): print("a")
elif n.isupper(): print("A")

Solution (Python):
D=input()
if str.isupper(D):
	print("A")
else:
	print("a")

Solution (Python):
print('aA'[input() in [chr(i) for i in range(65, 65+26)]])

Solution (Python):
n = input()
if n.isupper():
  print("A")
else:
  print("a")

Solution (Python):
a = input()
al = 'abcdefghijklmnopqrstuvwxyz'
if a in al:
    print('a')
else:
    print('A')

Solution (Python):
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

    s = readline().rstrip().decode()
    if s.isupper():
        print('A')
    else:
        print('a')


if __name__ == '__main__':
    main()

Solution (Python):

print(['A','a']['a' <= input() <= 'z'])

Solution (Python):
s = input()
print("a" if s.islower() else "A")

Solution (Python):


a = str(input())

if a.isupper():
    print("A")
else:
    print("a")

Solution (Python):
s=input()
if s==s.upper():
  print('A')
else:
  print('a')

Solution (Python):
import sys

def S(): return sys.stdin.readline().rstrip()

s = S()
t = s.upper()

if s == t:
    print('A')
else:
    print('a')

Solution (Python):
x = [s for s in input().split()]
X = str(x)
if X.isupper()==True:
    print('A')
else:
    print('a')

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    a = readline().strip()

    print("a" if a.islower() else "A")


if __name__ == "__main__":
    main()

Solution (Python):
print("A" if ord(input()) < 91 else "a")

Solution (Python):



a = input()
judge = a.islower()

if (judge):
    print('a')
else:
    print('A')

Solution (Python):
a = input()

if a.lower() == a:
    print("a")
else:
    print("A")

Solution (Python):
print('a'if input()in list('abcdefghijklmnopqrstuvwxyz') else 'A')

Solution (Python):
s=input()
if ord(s)<=90:
    print("A")
else:
    print("a")

Solution (Python):
a = input()

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

Solution (Python):








def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))





def main():
	s=input()

	if s==s.capitalize():
		print("A")
	else:
		print("a")







if __name__ == "__main__":
	main()

Solution (Python):
α = input()

if α.isupper() == True :
  print("A")
if α.islower() == True :
  print("a")

Solution (Python):
a = input()
if ord(a)-65<26:
    print('A')
else:
    print('a')

Solution (Python):
a = input()

b = a.lower()

if a == b:
    print("a")
else:
    print("A")

Solution (Python):
import sys

a=input()
b=ord(a)

if b>=65 and b<=90:
    print('A')

elif b>=97 and b<=122:
    print('a')

else:
    print('エラー')

Solution (Python):
a=input()
if a.isupper()==True:
  print("A")
else:
  print("a")

Solution (Python):
s = input()
if(ord(s[0]) >=97):
    print('a')
else:
    print('A')

Solution (Python):
A=input()

if A.isupper():
	print("A")
else:
	print("a")

Solution (Python):
a = input()
if "a" <= a <= "z":
  print("a")
else:
  print("A")

Solution (Python):

i = input()

v = ord(i) - ord('a')

if v >= 0 and v <= 26:
    print('a')
else:
    print('A')

Solution (Python):
a = input()
oomoji = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
komoji = "abcdefghijklmnopqrstuvwxyz"
if a in oomoji:
    print("A")
else:
    print("a")

Solution (Python):
a = input()

if a.islower():
    print("a")
else:print("A")

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

Solution (Python):
c=input()
if c.islower()==False:
    print("A")
else:
    print("a")

Solution (Python):
n=input()
s=['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']
if n in s:
  print('A')
else:
  print('a')

Solution (Python):
word = input()
li = ['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']
if word in li:
  print("a")
else:
  print("A")

Solution (Python):
S = input()
if S.islower():
  print('a')
else:
  print('A')

Solution (Python):
n=input()
if(n.islower()):
  print("a")
else:
  print("A")

Solution (Python):
s = str(input())
a = ['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']
if s in a:
    print('a')
else:
    print('A')

Solution (Python):
x = str(input())
if x.isupper() == True:
  print("A")
else:
  print("a")

Solution (Python):
α = input()
if(α.isupper()):
	print('A')
else:
	print('a')

Solution (Python):
alpha = input()

pos = ord(alpha)

if ord('A') <= pos and pos < ord('a'):
    print('A')
else:
    print('a')

Solution (Python):
def main():
  S=input()
  if 65<= ord(S) and ord(S)<97 :
  	print("A")
  elif 97<= ord(S) and ord(S)<123:
    print("a")

main()

Solution (Python):
c=input()
if str.islower(c):
  print('a')
else:
  print('A')

Solution (Python):
char=input()
if char.islower():
  print('a')
else:
  print('A')

Solution (Python):
a = input()

if a.isupper():
  print("A")
else:
  print("a")

Solution (Python):
a = input()
print("A" if a in "ABCDEFGHIJKLMNOPQRSTUVWXYZ" else "a")

Solution (Python):
s = str(input())
if s in "abcdefghijklmnopqrstuvwxyz":
  print("a")
else:
  print("A")

Solution (Python):
a = input()
if a in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
    print("A")
else:
    print("a")

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

Solution (Python):
s=input()
if s.isupper():
    print("A")
else:
    print("a")

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

Solution (Python):
a = input()
listA=["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"]
flag = 0
for i in range(len(listA)):
    if a == listA[i]:
        print("a")
        flag = 1
        break
if flag == 0:
    print("A")

Solution (Python):
a = input()
 
if str.isupper(a):
  print('A')
else :
  print('a')

Solution (Python):
input = input()
if input.isupper():
  print("A")
else:
  print("a")

Solution (Python):
a = str(input())
if a.isupper():
    print("A")
else:
    print("a")

Solution (Python):

import sys
input = sys.stdin.readline
a = str(input())
if a.isupper():
  print('A')
else:
  print('a')

Solution (Python):
s = input()
if s.isupper():
  print('A')
elif s.islower():
  print('a')

Solution (Python):
S=input()
if S.isupper():
    print("A")
else:
    print("a")

Solution (Python):
n = str(input())

A = [chr(i) for i in range(65,65+26)]

if n in A:
    print('A')
else:
    print('a')

Solution (Python):
A=input()

if A.isupper():
    print('A')
else:
    print('a')

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

Solution (Python):
a=input()
print("A" if 65<=ord(a)<=90 else "a")

Solution (Python):
print('aA'[input().isupper()])

Solution (Python):
print("A"if input()<"a"else"a")

Solution (Python):
N = str(input())

if N.isupper():
  print("A")
else:
  print("a")

Solution (Python):
str = input()
 
if str.isupper():
  print('A')
else:
  print('a')

Solution (Python):

 

 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools


 







 
S = input()

if S.isupper():
    print("A")
else:
    print("a")

Solution (Python):
g=input();print("a"if g.lower()==g else"A")

Solution (Python):
alpha = input()

if alpha.isupper():
	print("A")
else:
	print("a")

Solution (Python):
n=input()
if n.islower():
    print("a")
else:
    print("A")

Solution (Python):
x = input()

if x.islower():
    print('a')
else:
    print('A')

Solution (Python):
a = input()

if 97 <= ord(a):
    print('a')
else:
    print('A')

Solution (Python):
s = input()
x = s.upper()

if s == x:
    print('A')
else:
    print('a')

Solution (Python):
α = input()

if str.isupper(α) == False:
    print('a')
else:
    print('A')

Solution (Python):
a = input()

if a == ("Q"):
  print ("A")
if a == ("W"):
  print ("A")
if a == ("E"):
  print ("A")  
if a == ("R"):
  print ("A")
if a == ("T"):
  print ("A")
if a == ("Y"):
  print ("A")
if a == ("U"):
  print ("A")
if a == ("I"):
  print ("A")
if a == ("O"):
  print ("A")
if a == ("P"):
  print ("A")
if a == ("A"):
  print ("A")
if a == ("S"):
  print ("A")
if a == ("D"):
  print ("A")
if a == ("F"):
  print ("A")
if a == ("G"):
  print ("A")
if a == ("H"):
  print ("A")
if a == ("J"):
  print ("A")
if a == ("K"):
  print ("A")
if a == ("L"):
  print ("A")
if a == ("Z"):
  print ("A")
if a == ("X"):
  print ("A")
if a == ("C"):
  print ("A")
if a == ("V"):
  print ("A")
if a == ("B"):
  print ("A")
if a == ("N"):
  print ("A")
if a == ("M"):
  print ("A")

if a == ("q"):
  print ("a")
if a == ("w"):
  print ("a")
if a == ("e"):
  print ("a")
if a == ("r"):
  print ("a")
if a == ("t"):
  print ("a")
if a == ("y"):
  print ("a")
if a == ("u"):
  print ("a")
if a == ("i"):
  print ("a")
if a == ("o"):
  print ("a")
if a == ("p"):
  print ("a")
if a == ("a"):
  print ("a")
if a == ("s"):
  print ("a")
if a == ("d"):
  print ("a")
if a == ("f"):
  print ("a")
if a == ("g"):
  print ("a")
if a == ("h"):
  print ("a")
if a == ("j"):
  print ("a")
if a == ("k"):
  print ("a")
if a == ("l"):
  print ("a")
if a == ("z"):
  print ("a")
if a == ("x"):
  print ("a")
if a == ("c"):
  print ("a")
if a == ("v"):
  print ("a")
if a == ("b"):
  print ("a")
if a == ("n"):
  print ("a")
if a == ("m"):
  print ("a")

Solution (Python):
if(input().isupper()):
  print('A')
else:
  print('a')

Solution (Python):
n = input()
if n.isupper() == True:
  print("A")
else:
  print("a")

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

Solution (Python):
import sys
input = sys.stdin.readline

def slove():
    s = input()
    if s.upper() == s:
        print("A")
    else:
        print("a")

if __name__ == "__main__":
    slove()

Solution (Python):
S=input()
if S in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
    print('A')
else:
    print('a')

Solution (Python):
a = input()
if a.isupper():
	print ("A")
else:
	print ("a")

Solution (Python):
print("a") if ord(input()[0])>=97 else print("A")

Solution (Python):
N = str(input())
if N.isupper():
    print('A')
else:
    print('a')

Solution (Python):
C = input()
if C.isupper():
  print("A")
else:
  print("a")

Solution (Python):
a  = input()

if str.upper(a)==a:
    print("A")
else:
    print("a")

Solution (Python):
print('Aa'[input().islower()])

Solution (Python):
import re
a= input()
ans = "a"
if a.isupper():
  ans = "A"


print(ans)

Solution (Python):
s = str(input())
if s.isupper():
  print("A")
else:
  print("a")

Solution (Python):
a=input()
sult='A'
if a.islower()==True:
    sult='a'
print(sult)

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

Solution (Python):
a=input()

if ord('A') <= ord(a) <= ord('Z'):
  print('A')
else:
  print('a')

Solution (Python):

"""
Created on Sun Jun 21 20:57:48 2020

@author: naoki
"""

alpha = input()

if alpha.isupper() == True:
    print("A")
else:
    print("a")

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

Solution (Python):
print('A' if 65<=ord(input())<=91 else 'a')

Solution (Python):
a = input()

ret = "A"
if "a" <= a and a <= "z":
    ret = "a"

print("{}".format(ret))

Solution (Python):
ch = input()
print('A' if 65<=ord(ch)<=91 else 'a')

Solution (Python):
s=input()
if 65<=ord(s)<=90:
  print("A")
else:
  print("a")

Solution (Python):
s=input()
if s.isupper():
    print("A")
else:
    print("a")

Solution (Python):
n=input()
trans=["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"]
if n in trans:
  print("a")
else: print("A")

Solution (Python):
a = input()
if a.islower():
    print('a')
else:
    print('A')

Solution (Python):
a = input()
if a.upper() == a:
    print('A')
else:
    print('a')

Solution (Python):
if (input().islower()):print('a')
else: print('A')

Solution (Python):
A = input()
if str.islower(A):
    print('a')
else:
    print('A')

Solution (Python):
n = input()
if(n.islower()):
    print('a')
elif(n.isupper()):
    print('A')

Solution (Python):
a = str(input())

if ord(a) >=97:
    print("a")
else:
    print("A")

Solution (Python):
mai= ['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']
min2= ['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= input()
if a in mai:
    print('a')
elif a in min2:
    print('A')

Solution (Python):
p = input()
p = ord(p)
print("A") if p>=65 and p<=90 else print("a")

Solution (Python):
x=input()
A = ['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 = ['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']
if x in A:
	print('A')
if x in a:
	print('a')

Solution (Python):
N = input()

if N == N.upper():
  print('A')
else:
  print('a')

Solution (Python):
str = input().strip()
print("A" if str.isupper() == True else "a")

Solution (Python):
N= input()
if str.isupper(N) == True:
  print("A")
else:
  print("a")

Solution (Python):
n=input()
if n.isupper()==True:
  print("A")
else:
  print('a')

Solution (Python):
str = input()

if str.islower():
	print("a")
else:
    print("A")

Solution (Python):
n = ord(input())
print('a' if n >= 97 else 'A')

Solution (Python):
a = input()
b = a.isupper()
if b == True:
    print("A")
else:
    print("a")

Solution (Python):
cap = str(input())
if cap.isupper():
    print("A")
elif cap.islower():
    print("a")

Solution (Python):
s = input()
if s.isupper():
    print("A")
else:
    print("a")

Solution (Python):
a = input()
if a == a.lower():
    print("a")
else:
    print("A")