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 math

import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)

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

    return

if __name__ == '__main__':
    main()

Solution (Python):
a = input()

if ord(a) - ord('A') <= 26:
    print("A")
else:
    print("a")

Solution (Python):
a = input()

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

Solution (Python):



s = input()

large = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
small = 'abcdefghijklmnopqrstuvwxyz'

ans = 'no'
for i in range(26):
    if(s == large[i]):
        ans = 'A'
    elif(s == small[i]):
        ans = 'a'

print(ans)

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

main()

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())
ips=lambda:input().split()

"""========main code==============="""
a=ip()
if( a.islower()):
    print("a")
else:
    print("A")

Solution (Python):
str = input() 

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

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode()
if str.isupper(S):
    print('A')
else:
    print('a')

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

Solution (Python):

M = str(input())
if M.islower()==True:
    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")
else: print("A")

Solution (Python):
n = input()
if n.islower():
    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):
a = input()


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

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

Solution (Python):
import math
import fractions
import collections
import itertools
a=input()
if ord(a)-ord("a")>=0:
    print("a")
else:
    print("A")

Solution (Python):
def main():
    a = input()

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

if __name__=="__main__":
    main()

Solution (Python):
S = input()

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

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

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

Solution (Python):
a = input()
print('A') if a.isupper() else print('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):

"""
@author: H_Hoshigi
"""
def main():
    S = input()
    if S.isupper():
        print("A")
    else:
        print("a")

if __name__ == "__main__":
    main()

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')

def main():
    a = input()
    if a.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 s == s.upper():
  print("A")
else:
  print("a")

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

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

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

Solution (Python):
s = input()
al=[chr(ord('a') + i) for i in range(26)]
if s in al:
    print('a')
else:
    print('A')

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a = S()
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
if a in ascii_lowercase:
    print('a')
else:
    print('A')

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

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

Solution (Python):
import sys
import numpy as np
import math
from collections import deque 
from functools import reduce

s = input()

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

Solution (Python):
S = input()
if S.upper() == S and S.lower() != S:
    print("A")
else:
    print("a")

Solution (Python):
import string

print("A" if input().strip() in string.ascii_uppercase else "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):
a = input()
print('A' if a.isupper() else 'a')

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

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

Solution (Python):
a = input()

if a.isupper():
    ans = "A"
else:
    ans = "a"

print(ans)

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

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

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

Solution (Python):
a=input()

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

Solution (Python):
s=input()

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

Solution (Python):
c = input()

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

Solution (Python):
from sys import stdin
a = (stdin.readline().rstrip())
if a == a.upper():
    print("A")
else:
    print("a")

Solution (Python):


alp = input()

if ord("a") <= ord(alp) <= ord("z"):
    print("a")
if ord("A") <= ord(alp) <= ord("Z"):
    print("A")

Solution (Python):
a = input()

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

Solution (Python):
def run(_char):
    '''
    '''
    print('A' if str.isupper(_char) else 'a')

if __name__ == '__main__':
    _char = input()
    run(_char)

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

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

Solution (Python):
import string
a=string.ascii_uppercase
A=input()
flag=0
for i in a:
    if i==A:
        flag=1
        break
if flag==0:
    print("a")
else:
    print("A")

Solution (Python):
a = input()

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

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

Solution (Python):
import sys











stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    a= str(stdin.readline().rstrip())
    
    
    
    
    
    
    if a.islower():
        print("a")
    else:
        print("A")

main()

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

Solution (Python):
N = input()

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

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

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


s = readline().decode().rstrip()

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

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

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

Solution (Python):
def main():
    import string
    import sys
    def input():
        return sys.stdin.readline()[:-1]
    α=input()
    if α in string.ascii_uppercase:
        print("A")
    else:
        print("a")
    

    
if __name__ == '__main__':
    main()

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

Solution (Python):
a = input()

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

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a = ns()

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

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

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

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

Solution (Python):
alpha = input()
tmp = "qwertyuiopasdfghjklzxcvbnm"
ans = 'A'
for i in tmp:
    if alpha == i:
        ans = 'a'
print(ans)

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

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

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

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

Solution (Python):
al = input()

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

Solution (Python):
a = input()
x = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
y = 'abcdefghijklmnopqrstuvwxyz'

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

Solution (Python):
a = input()

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

Solution (Python):
a = ord(input())
s = [ord("a")+i for i in range(26)]
if a in s:
    print("a")
else:
    print("A")

Solution (Python):
S = input()

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

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

def main():
    if s.isupper():
        print("A")
        return
    print("a")
    return

main()

Solution (Python):
a = input()

print("A" if ord(a)<95 else "a" )

Solution (Python):
def main():
    a = input()

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


if __name__ == "__main__":
    main()

Solution (Python):
def main() -> None:
    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):
i = input()

if i.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() :
    ans = 'A'
else :
    ans = 'a'

print(ans)

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

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

Solution (Python):
def resolve():
    s=input()
    abcd = 'abcdefghijklmnopqrstuvwxyz'
    if s in abcd:
        print("a")
    else:
        print("A")
resolve()

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
def main():
    a = input()

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):

s = input()



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

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

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

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

Solution (Python):
X = input()

al=[chr(ord('a') + i) for i in range(26)]

if X in al:
    print('a')
else:
    print('A')

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

Solution (Python):
import re

S = input()

if re.fullmatch('[A-Z]',S):
  print('A')
else:
  print('a')

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


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

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

Solution (Python):



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

Solution (Python):
alpha = input()

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

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


a = input()

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

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

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

Solution (Python):

alpha = str(input())



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

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

Solution (Python):



import sys


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


def resolve():
    s = input().rstrip()

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


if __name__ == "__main__":
    resolve()

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

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

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

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

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

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

a = input()
komoji = [chr(i) for i in range(97, 97+26)]
if  a in komoji:
    print("a")
else:
    print("A")

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

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

Solution (Python):
a = input()

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

Solution (Python):

s=input()

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

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

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

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

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

Solution (Python):
s = input()

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

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

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


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
letter = input()

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

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

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

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

Solution (Python):
a = input()

if 'a' <= a <= 'z':
    print('a')
else:
    print('A')

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

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

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

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

Solution (Python):
s = input()

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

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

    
if 'unittest' not in globals():
    resolve()

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

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

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

Solution (Python):
if 97 <= ord(input()) <= 122:
    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):
x = input()

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

Solution (Python):
X = input()

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

Solution (Python):
n = input()

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

Solution (Python):
a = input()

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

Solution (Python):

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

Solution (Python):
n = input()
def small_letters():
    return [chr(i) for i in range(97, 97+26)]
def capital_letters():
    return [chr(i) for i in range(65, 65+26)]
if n in small_letters():
    print("a")
else:
    print("A")

Solution (Python):
n = ord(input())
if 65 <= n <= 90:
    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):
a = ord(input())

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

Solution (Python):
import string

a = input()

if a in string.ascii_uppercase:
    print('A')
else:
    print('a')

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

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

Solution (Python):
S = input()

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

Solution (Python):
a = input()

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

Solution (Python):
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7

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

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

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

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

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

Solution (Python):
C = input()
L = 'abcdfeghijklmnopqrstuvwxyz'
if C in L:
  print('a')
else:
  print('A')

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

Solution (Python):

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



if __name__ == "__main__":
    main()

Solution (Python):
a = input()

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

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

Solution (Python):


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

if __name__ == "__main__":
    main()

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

Solution (Python):
a = input()

if a >= 'a' and a <= 'z':
    print('a')
else:
    print('A')

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

if __name__ == '__main__':
    main()

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

if a.isupper() == True:
  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 > 'Z' else "A")

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

if n.isupper():
	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):
def main():
    print('a' if input().islower() else 'A')

main()

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

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

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

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

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

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

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

Solution (Python):
str=input()
if str.isupper():
    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):
def main():
    a = input()

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):


def resolve():
    import sys
    input = sys.stdin.readline
    n = str(input().rstrip())

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

    
    
    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    
    
    
    

    


if __name__ == "__main__":
    resolve()

Solution (Python):

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

if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

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

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

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

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

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

Solution (Python):
s = input()

low=s.lower()

if low==s:
    print("a")
else:
    print("A")