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 ord(a) < ord("a"):
    print("A")
else:
    print("a")

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

Solution (Python):
alpha = input()

if alpha in 'QWERTYUIOPASDFGHJKLZXCVBNM':
    print('A')
else:
    print('a')

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

else:
    print('a')

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

else:
    print('a')

Solution (Python):
A = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
c = input()
if c in A :
    print('A')

else:
    print('a')

Solution (Python):


import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = input()

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

Solution (Python):
α=input()

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

Solution (Python):


import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = input()

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

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

Solution (Python):
S = input()

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

Solution (Python):
import re

a = input()
if re.match(r'[a-z]', a) is not None:
	print('a')
else:
	print('A')

Solution (Python):


import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = input()

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

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

Solution (Python):
letter=input()

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

Solution (Python):
def a171(a):

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

def main():
    a = str(input())
    print(a171(a))

if __name__ == '__main__':
    main()

Solution (Python):

a = input()

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

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

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

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

Solution (Python):
c = input()

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

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

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

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

Solution (Python):
k = input()

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

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

Solution (Python):
A = input()

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

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

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
str1 = input()

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

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

Solution (Python):

alpha = input()
large = ["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 alpha in large:
    print("A")
else:
    print("a")

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

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

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

Solution (Python):
aa = input()

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

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

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

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

Solution (Python):
s = input()

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

Solution (Python):

def main():
  a = input()
  if ord(a) > ord('Z'):
      print('a')
  else:
      print('A')
main()

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

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

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

Solution (Python):
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

a = S()

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

Solution (Python):
n = input()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    resolve()

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


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
a = input()
if ord(a) < 97:
    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() == True:
    print("A")
else:
    print("a")

Solution (Python):
str =input()

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

Solution (Python):
a = input()
if ord(a) in range(65,91): print('A')
if ord(a) in range(97,123): print('a')

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

Solution (Python):
alpha = input()

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

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

a = S()

if a.islower():
    print('a')
    exit()

print("A")

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

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

Solution (Python):
def main():
  s = input()
  ans = 'A' if s.upper() == s else 'a'
  print(ans)
    
    
    
 
if __name__ == '__main__':
  main()

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

Solution (Python):


x = input()
x = ord(x)

if x >= 97 and x <= 122:
  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):
if input().isupper():
    print("A")
else:
    print("a")

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

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

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

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

Solution (Python):
m = input()

if m >= 'A' and m <= 'Z':
    print("A")

else:
    print('a')

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

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

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

Solution (Python):

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

Solution (Python):
alpha = input()

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

Solution (Python):
import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal


def main():
    a = input()
    if ord(a) >= ord("a") and ord(a) <= ord("z"):
        print("a")
    else:
        print("A")


if __name__ == '__main__':
    main()

Solution (Python):

def main():
    letra = input()

    if letra == letra.upper():
        print("A")
    else:
        print("a")
if __name__ == "__main__":
    main()

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

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


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
def main():
    s = input()
    ko = [i for i in range(ord('a'),ord('z')+1)]
    if ord(s) in ko:
        print('a')
    else:
        print('A')

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print("a" <= s <= "z" and "a" or "A")

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
s = input()

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    s = S()

    if 'A' <= s <= 'Z':
        return 'A'

    return 'a'


print(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.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):
N = input()

if str.isupper(N):
  print("A")
else:
  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')

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

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

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

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

Solution (Python):
char = input()

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

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

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

Solution (Python):
import string

alpha = input()
if alpha in string.ascii_lowercase:
    print("a")
else:
    print("A")

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
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 operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')



 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix

 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





a=ss()

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

Solution (Python):
s = input()

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

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

Solution (Python):
alpha = input()

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

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

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

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

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

Solution (Python):
data = input()
if data >= "a" and data <= "z":
    print("a")
elif data >= "A" and data <= "Z":
    print("A")

Solution (Python):
in_x = str(input())
h = in_x.islower()
if h == True:
    print("a")
elif h == False:
    print("A")

Solution (Python):
n = input()

if n > 'Z':
    print("a")
else:
    print("A")

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

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):




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

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
a=input()

if a in "qwertyuiopasdfghjklzxcvbnm":
  print("a")
else:
  print("A")

Solution (Python):
a = input()

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

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

Solution (Python):
def c172(x):
    x = int(x)
    return x + x**2 + x**3

def c171(x):
    if str.isupper(x): return 'A'
    else: return 'a'
    

if __name__=="__main__":
    input = input()
    print(c171(input))

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

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

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

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

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

Solution (Python):
A = input().islower()
if A:
  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):
x=input()
alpha='abcdefghijklmnopqrstuvwxyz'

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
A = input()

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

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

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

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
import re

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

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

Solution (Python):


def resolve():
    import sys
    input = sys.stdin.readline
    n = input().rstrip()
    if n.islower():
        print("a")
    else:
        print("A")



if __name__ == "__main__":
    resolve()

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

main()

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

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

Solution (Python):
c = input()

if c.isupper():
    ans = 'A'
else:
    ans = 'a'

print(ans)

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

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

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

Solution (Python):
a = input()

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

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

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

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

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

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

Solution (Python):
a = input()

if a in "qwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnm":
  print ("a")
  
else :
  print("A")

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

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

Solution (Python):
from sys import stdin, stdout
read = stdin.readline
write = stdout.write
flush = stdout.flush
xr = xrange

def main():
	c = read().strip()
	if ord(c) - ord('A') <= 26: write('A\n')
	else: write('a\n')

if __name__ == "__main__":
	main()

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

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

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

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

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

def resolve():
    s=input()
    alphabets=list(chr(ord('a')+i) for i in range(26))
    if s in alphabets:
        print('a')
    else:
        print('A')
resolve()

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

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

Solution (Python):
x=input()

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

Solution (Python):
a=input()

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

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

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

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

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

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

Solution (Python):
alpha = input()

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

Solution (Python):
char = input()

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

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

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

Solution (Python):
str_ = input()

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

Solution (Python):
x = input()

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

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

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

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

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

Solution (Python):
import re

a = input()

if re.match(r'[A-Z]', a) is not None :
    print("A")

if re.match(r'[a-z]', a) is not None:
    print("a")

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

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

Solution (Python):
a = input()
a_list = [chr(i) for i in range(97, 97+26)]

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

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

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

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

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

Solution (Python):


cmdvar_C=input()

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

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

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

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

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

Solution (Python):
print("Aa"[ord(input())>95])

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

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

Solution (Python):

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

Solution (Python):
s=input()

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

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

print(result)

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

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

Solution (Python):
from sys import stdin
import re

alpha = stdin.readline().rstrip()

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

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()
print('A' if S().isupper() else 'a')

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

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

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

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

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

Solution (Python):
x = input()

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

Solution (Python):
import sys

input_data = []
input_pointer = 0

output_data = []

def input_scan():
    global input_data
    input_data = sys.stdin.readlines()
    input_data = [x[:-1] for x in input_data]

def next_line():
    global input_pointer
    global input_data
    if input_pointer < len(input_data):
        input_pointer += 1
        return input_data[input_pointer - 1]
    else:
        return ""

def append_output(string):
    global output_data
    output_data.append(string)

def print_output():
    global output_data
    output_data.append("")
    sys.stdout.write("\n".join(output_data))

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

Solution (Python):
N = str(input())
if N >= 'a':
  print('a')
else:
  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
from collections import Counter,defaultdict


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

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

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

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

Solution (Python):
s=input()
a="abcdefghijklnmopqrstuvwxyz"
A="ABCDEFGHIJKLNMOPQRSTUVWXYZ"
if s in a:
  print("a")
else:
  print("A")

Solution (Python):
a = input()

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

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

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

Solution (Python):
c = input()

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

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

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

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