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):


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    alpha = ns()
    print("A" if alpha.isupper() else "a")

if __name__ == "__main__":
    main()

Solution (Python):
import sys

a = sys.stdin.readline()

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

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

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

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

Solution (Python):
def solve(a):
    return "A" if "A" <= a <= "Z" else "a"

a = input()
print(solve(a))

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

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

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

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

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

Solution (Python):
α = input()

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

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

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

Solution (Python):
al = input()

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

Solution (Python):
letra = input()

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

Solution (Python):
word = input()
A = [chr(i) for i in range(65, 65+26)]
a = [chr(i) for i in range(97, 97+26)]
if A.count(word) == 1:
  print('A')
else:
  print('a')

Solution (Python):
import string

s = input()
if s in string.ascii_lowercase:
    print('a')
else:
    print('A')

Solution (Python):
text = input()

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

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

if __name__ == "__main__":
    resolve()

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
S = input()

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

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

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

if alpha.isupper()==True:
	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):
mozi=input()
ju=mozi.islower()
ju2=mozi.isupper()
if ju==True:
  print("a")
else:
  print("A")

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

Solution (Python):
ans = input().isupper()
if ans == True:
  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):
mod = int(1e9+7)
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
    
    ch = raw_input()
    
    if ch.isupper():
        print('A')
    else:
        print('a')
    

main()

Solution (Python):


import io
import sys
import math

def main():
    s = input()
    
    ans = "A" if s.lower() != s else "a"
    print(ans)


_INPUT = """\
1
"""
_DEB = 0   

def logd(str):
    """usage:
    if _DEB: logd(f"{str}")
    """
    if _DEB: print(f"[deb] {str}")


if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    main()

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

Solution (Python):

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

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

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

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

Solution (Python):
s=input()

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

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

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

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

Solution (Python):
a = str(input())
if a.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.upper()==a else "a")

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

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

Solution (Python):
import sys
import math
import collections
 
def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin
 
 
def int_input():
    return list(map(int, input().split()))
 
 
if __name__ == '__main__':
    
 
    t = input()
    
    if 'A' <= t <= 'Z':
        print('A')
    else:
        print('a')

Solution (Python):
x = ["a","b","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 input() in x:
  print('a')
else:
  print('A')

Solution (Python):
s = input()
for i in range(len(s)):
    if s.upper() == s:
        print("A")
    elif s.lower() == s:
        print("a")

Solution (Python):
a = input()

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
s = input()

if 'a' <= s <= 'z':
    print('a')

else:
    print('A')

Solution (Python):
n = input()

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

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

Solution (Python):
line = input()

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

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

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

Solution (Python):

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

Solution (Python):
input = input()

if (ord(input) >= 65 and ord(input) <= 90):
  print('A')
else:
  print('a')

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

Solution (Python):
a=input()

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

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

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

Solution (Python):
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd

a = input()

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

Solution (Python):
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007

inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')



def solve():
    
    

    s=si()
    if 'a'<=s[0]<='z':
        print('a')
    else:
        print('A')

    










        
if __name__ =="__main__":

    if path.exists('input.txt'):
        sys.stdin=open('input.txt', 'r')
        sys.stdout=open('output.txt','w')
    else:
        input=sys.stdin.readline
    solve()

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

a = input()
ans = "A" if a.isupper() else "a"
print(ans)

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

Solution (Python):
data = input()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    S = input().strip()

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



if __name__ == '__main__':
    main()

Solution (Python):
import re

a = str(input())

if re.match("[A-Z]", a):
    print("A")
else:
    print("a")

Solution (Python):
x = input()

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

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

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

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

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

Solution (Python):
def solve():
    letter = input()

    answer = 'A' if letter.upper() == letter else 'a'

    return answer


def main():
    print(solve())


if __name__ == "__main__":
    main()

Solution (Python):









import sys

def input(): return sys.stdin.readline()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]

OutV = lambda x: print(*x, sep='\n')

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)


s = input()

if s == s.upper():
    ans = 'A'
else:
    ans = 'a'

print(ans)

Solution (Python):
from sys import stdin

A=stdin.readline()

if ord(A[0])<97:
  print('A')
else:
  print('a')

Solution (Python):
α = input()

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

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

Solution (Python):
s1='abcdefghijklmnopqrstuvwxyz'
s2='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
s=input()
for x in s:
    if x in s1:
        print('a')
    else:
        print('A')

Solution (Python):
a=input()
x=ord(a)
if ord("a")<=x<=ord("z"):
    print("a")

elif ord("A")<=x<=ord("Z"):
    print("A")

Solution (Python):
a = input()

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

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

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

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

Solution (Python):
import string
if input() in string.ascii_uppercase:
    print('A')
else:
    print('a')

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

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

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

Solution (Python):
i = input()

if "a" <= i <= "z":
  print("a")
else:
  print("A")

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

Solution (Python):
str = input()

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

Solution (Python):
str = input()

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

Solution (Python):
import sys

c = sys.stdin.readline().strip()
if c.upper() == c:
    print("A")
else:
    print("a")

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

Solution (Python):
alpha = input()

if alpha.upper() == alpha:
    ans = "A"
else:
    ans = "a"

print(ans)

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

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

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

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

Solution (Python):
x = input()

res = 'A' if x.isupper() else 'a'

print(res)

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):

from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement




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

Solution (Python):

from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement




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

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

Solution (Python):

a = str(input())
 
if 'a' <= a <= 'z':
  print('a')
if 'A' <= a <= 'Z':
  print('A')

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

Solution (Python):
a = input().islower()

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a = input()[:-1].decode()
    if a == a.lower():
        print('a')
    else:
        print('A')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007



def main():
	
	
	s = input()
	if ord('A') <= ord(s) and ord(s) <= ord('Z'):
		return 'A'
	return 'a'
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):
import string
s = input()
s = s[0]
a = string.ascii_lowercase
a = a.find(s)
if a == -1:
	print('A')
else:
	print('a')

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    
    if s.islower():
        print("a")
    else:
        print("A")

main()

Solution (Python):
print('a' if ord(input()) & 32 else 'A')

Solution (Python):



a = input()


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

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):

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

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

Solution (Python):
from queue import LifoQueue


def print_sol(c, sol):
    print('Case 


def rd_int():
    return int(input())


def rd_str():
    return input()


def rd_str_lst():
    return input().split(' ')


def sp_str_lst():
    return list(input())


def rd_int_lst():
    return [int(i) for i in rd_str_lst()]


def sp_int_lst():
    return [int(i) for i in sp_str_lst()]


def dfs(g, i, v):
    """
    recursive post order dfs
    Args:
        g: array of graph nodes
        i: node to traverse
        v: visited array

    Returns: a post order dfs of graph g
    """
    v[i] = True
    for j in g[i]:
        if not v[j]:
            dfs(g, j, v)

    print(i)


def dfs_iter(g, i, n):
    v = [False] * n
    stack = LifoQueue()
    stack.put(i)
    while stack.not_empty:
        u = stack.get()
        v[u] = True
        print(u)
        for i in g[u]:
            if not v[i]:
                stack.put(i)


def main():
    t = rd_str()
    if ord('a') <= ord(t) <=ord('z'):
        print('a')
    else:
        print('A')


if __name__ == '__main__':
    main()

Solution (Python):
c = input()

if 'A' <= c and c <= 'Z':
  print('A')
elif 'a' <= c and c <= 'z':
  print('a')

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

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

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

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

Solution (Python):
chr  = input();
ans = 'A' if ord(chr) >=65 and ord(chr) <= 90 else 'a'
print(ans)

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    a = input()
    if a.islower():
        print('a')
    else:
        print('A')
resolve()

Solution (Python):
pha = 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 pha in li:
    print("a")
else:
    print("A")

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

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

Solution (Python):
s = input()

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

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

Solution (Python):



def main():
    s = input()

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a = input()

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

Solution (Python):
alpha = input()

print("A" if alpha.upper() == alpha else "a")

Solution (Python):


a = str(input())

if a.isupper():
    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):
s = input()

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

Solution (Python):
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

s=S()
if s.isupper():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):
c = input()
print("A" if c.isupper() else "a")

Solution (Python):
S = input()

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

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

Solution (Python):
n = input()
l = "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".split()
if n in l:
    print("A")
else:
    print("a")

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

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
data = input()
temp = ord(data)
if 97 <= temp <= 122:
    print('a')
if 65 <= temp <= 90:
    print('A')

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

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

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

Solution (Python):
import math
import sys

def dict_sort(ans):
    ans=sorted(ans.items(),reverse=True,key=lambda kv:(kv[1]))

def seive_primes(n):
    flag=[0]*(n+10)
    flag[1]=flag[0]=1
    i=2
    while i*i<=n+1:
        if flag[i]==0:
            j=i*i
            while j<=n+1:
                flag[j]=1
                j+=i
        i+=1
    return flag

def is_prime(n):
    if n==1:
        return 0
    for i in range(2,int(math.sqrt(n))+1):
        if n%i==0:
            return False
    return True

def gcd(a,b):
    if b==0:
        return a
    return gcd(b,a%b)

def lcm(a,b):
    return (a*b)//gcd(a,b)

def alphbates():
    return "abcdefghijklmnopqrstuvwxyz"

def inp():
    ls=list(map(int,input().split()))
    return ls

def mult_inp():
    return map(int,input().split())

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

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

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

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

Solution (Python):
import sys
 
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
 
 
def resolve():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")
 
 
 
if __name__ == '__main__':
    resolve()

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

Solution (Python):

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")



if __name__ == '__main__':
    resolve()

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

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

Solution (Python):
def main():
    a = input()
    print("A" if ord(a) <= ord("Z") else "a")
    return


main()

Solution (Python):
ab=input("")

if ab >="A" and ab <="Z":
    print("A")
else:
    print("a")

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
a=input()
print("aA"[a.upper()==a::2])

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
n=input()

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

Solution (Python):
x = input("")

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

Solution (Python):
inp=input()
if inp>="A" and inp<="Z":
    print("A")
elif inp>="a" and inp<="z":
    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):
if ord(input()) <= 90:
  print('A')
else:
  print('a')

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

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

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

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

Solution (Python):
a = input()

if a.islower() == True:
    print("a")

else:
    print("A")

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

Solution (Python):
import re

x = input()

if re.search("[A-Z]",x) is not None:
  print("A")
else:
  print("a")

Solution (Python):
A = input()

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

Solution (Python):
a = input()

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

Solution (Python):
letter = input()

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    s = input().rstrip('\n')
    if s.isupper():
        print("A")
    else:
        print("a")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()


from collections import deque  
def main():
    a = input()
    if a.isupper() == True:
        print('A')
    else:
        print('a')


if __name__=='__main__':
    main()

Solution (Python):
a = input()

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

print('a')

Solution (Python):
if __name__ == '__main__':
    in_str = input()

    if in_str.isupper():
        print('A')

    else:
        print('a')

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

Solution (Python):
s = input()
if len(s) == 1:
    if s.islower():
        print("a")
    if s.isupper():
        print("A")

Solution (Python):
alpha = input()

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

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):

import sys
input = sys.stdin.readline

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

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

Solution (Python):
s = input()
if s.islower():
    print('a')
else:
    print('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):
import sys



if __name__ == '__main__':
    IN = [x.strip() for x in sys.stdin.readlines()]

    c = IN[0]
    print('A' if 'A' <= c <= 'Z' else 'a')

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

Solution (Python):
c = input()
oc = ord(c)

if 65<=oc<=90:
  print('A')
else:
  print('a')

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

if a < 97:
    print("A")
else:
    print("a")

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

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

Solution (Python):
a = input()

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):

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

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

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

Solution (Python):
x = input()

x = ord(x)
if 65 <= x and x <= 90:
  print('A')
elif 97 <= x and x <= 122:
  print('a')

Solution (Python):
a = input()

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

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

Solution (Python):
alp = input()

if alp.isupper() == True:
    print('A')

else:
    print('a')

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

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

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

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

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

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

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