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 re
s = input()
pattern = '[A-Z]+'
if re.match(pattern,s):
    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):
from copy import copy
a = input()
b = copy(a)
if a == b.upper():
    print('A')
else:
    print('a')

Solution (Python):
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):
import sys



















S = str(input())
A = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U","V","W","X","Y","Z"]

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

Solution (Python):
A = input()

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

import math



from collections import deque
from collections import Counter





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

Solution (Python):
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    num = ord(input())
    if num >= 65 and num <= 90:
        print('A')
    else:
        print('a')

if __name__ == '__main__':
    main()

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

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

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

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

if a2 == True:
    print('A')
else:
    print('a')

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

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

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

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

Solution (Python):

import re

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



if __name__ == "__main__":
  resolve()

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

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

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

Solution (Python):
al = input()

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
a = input()

judge = a.isupper()
judge2 = a.islower()

if judge == True :
    print("A")

if judge2 == True :
    print("a")

Solution (Python):
import re

a = input()

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
ZIP = lambda: zip(*(MAP() for _ in range(n)))

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


def main():
    a = INPUT()

    for i in ascii_uppercase:
        if i == a:
            print("A")
            break
    else:
        print("a")


if __name__ == '__main__':
    main()

Solution (Python):
s=input().strip()
if s in 'abcdefghijklmnopqrstuvwxyz':
    print('a')
else:
    print('A')

Solution (Python):
import sys

a = sys.stdin.readline().strip()
if ord(a) >= ord("a"):
    print("a")
else:
    print("A")

Solution (Python):
a=input()

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

else:
    print("A")

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

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

s = ns()

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

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

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

Solution (Python):
s = input()

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
a=input()

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

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

Solution (Python):
Alphabet = input()

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

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

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

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

Solution (Python):

val=input()

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

Solution (Python):






a = input()

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

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    N=input()
    if N.lower()==N:
        print("a")
    else:
        print("A")

resolve()

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

dai = set(["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 a in dai :
  print("A")
else :
  print("a")

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    x = lines[0]
    

    return (x, )


def solve(x):

    upper = set("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    lower = set("abcdefghijklmnopqrstuvwxyz")

    result = 'a'
    if x in upper:
        result = 'A'

    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

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

Solution (Python):

alpha = input()

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

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

s = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

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

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

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

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

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

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

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

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

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

Solution (Python):
char = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = "abcdefghijklmnopqrstuvwxyz"
n = input()
if a.count(n) == 1:
    print("a")
else:
    print("A")

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

Solution (Python):

alpha = input()

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

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

Solution (Python):
import string

l=string.ascii_lowercase
L=string.ascii_uppercase

a=input()

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

Solution (Python):
a = input()

ord_s = ord(a)

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

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

Solution (Python):
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    a = S()
    if a<'a':
        print('A')
    else:
        print('a')
    print
    return

if __name__=='__main__':
    Main()

Solution (Python):
n = input()

print("A" if 65 <= ord(n) <= 91 else "a")

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

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

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

Solution (Python):

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

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

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

Solution (Python):
s = input()
A = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ans = "a"
for x in A:
    if s == x:
        ans = "A"
        break
print(ans)

Solution (Python):
s=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']
ok=0
for a in l:
    if a==s:
        ok=1
        break

if ok==0:
    print('A')
else:
    print('a')

Solution (Python):
A = input()

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

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

Solution (Python):
x=input()

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

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

Solution (Python):
if __name__ == "__main__":
    a = input().strip()

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

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

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

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

Solution (Python):
s=input()

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

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

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

Solution (Python):
s = input()
sl = list('abcdefghijklmnopqrstuvwxyz')
sc = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
if s in sl:
    print('a')
else:
    print('A')

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

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

Solution (Python):



s = input()

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

Solution (Python):
S=input()

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

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

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

Solution (Python):
N = input()

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

Solution (Python):
n = input()

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

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

Solution (Python):



L=[chr(i) for i in range(65,91)]
a=input()

ans="a"
if a in L: ans="A"

print(ans)

Solution (Python):
alpha = input()

ans = 'A'

if alpha.lower() == alpha:
  ans = 'a'

print(ans)

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

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

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

S=str(input())

if S in listA:
    print("A")
else:
    print("a")

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

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

Solution (Python):
A = input()

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

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

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

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

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

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

Solution (Python):
a = input()

b = a.upper()

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

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

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

Solution (Python):

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

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

Solution (Python):
A=[chr(i) for i in range(ord("a"),ord("z")+1)]
a=input()
if a in A:
  print("a")
else:
  print("A")

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

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

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

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



def main():
    A = input().strip()
    if 64 < ord(A) and ord(A) < 91:
        return "A"
    else:
        return "a"


if __name__ == "__main__":
    print(main())

Solution (Python):
a = input()

if str.isupper(a):
    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()
print('a' if a.upper() != a else 'A')

Solution (Python):
s = input()

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

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

Solution (Python):
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction






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

Solution (Python):
a = input()

ret = a

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

Solution (Python):
n=input()

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

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

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

Solution (Python):
import string
s = input()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

if s in ascii_lowercase:
    print('a')
else:
    print('A')

Solution (Python):
x = input()

X = x.upper()

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

Solution (Python):
from sys import stdin

str = stdin.readline().rstrip()

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

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

Solution (Python):

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

Solution (Python):
x=input()

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

Solution (Python):
import re

chr = input()


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

Solution (Python):
alpha = input()

if alpha 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):
target = str(input().split())
if target.isupper():
  print('A')
else:
  print('a')

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
import re

A = input()

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

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

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

Solution (Python):
N = input()

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

elif N.islower() == True:
    print("a")

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

Solution (Python):
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    a = kwargs["a"]
    res = "a"

    if a.isupper():
        res = "A"

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["a"] = cin[0]

    cout = main(kwargs)
    print(cout)

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

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

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

Solution (Python):

import math

for i in range(1):
    s=input()
    if s.isupper():
        print("A")
    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):
x=input()

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

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

Solution (Python):
import sys
a = sys.stdin.readline().rstrip("\n")
if a.isupper():
    print('A')
else:
    print('a')

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

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

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

Solution (Python):
import sys

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
str = input()

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

else:
    print("a")

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

Solution (Python):
C = str(input())
ans = "A"
alpha = "abcdefghijklmnopqrstuvwxyz"

for i in alpha:
    if C == i:
        ans = "a"
        break

print(ans)

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

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

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

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

Solution (Python):


word = input()




if str.isupper(word) == True:
    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):
a = input()
b = a.lower()
print('a' if a == b else '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):
a=input()
if a.isupper():
    print("A")
else:
    print("a")

Solution (Python):
a = input()

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

Solution (Python):















mod = int(1e9+7)

INF = 1<<50

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

def main():
    a = input()
    if ord(a)-65<=25:
        print('A')
    else:
        print('a')
    return

if __name__=='__main__':
    main()

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

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

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


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

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

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

Solution (Python):
a = input()
au = a.upper()

if a == au:
  print('A')
else:
  print('a')

Solution (Python):
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'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
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')





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

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

Solution (Python):
alp = input()

big = ["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 alp in big:
    print("A")
else:
    print("a")

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


if __name__ == '__main__':
    main()

Solution (Python):
N = input();

N_o = str.upper(N)
N_k = str.lower(N)

if N == N_o:
    print("A")
elif N == N_k:
    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):
S = input()









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

Solution (Python):
A = input()

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

Solution (Python):
def main():
    a = input()
    if a == 'A' or a == 'B' or a == 'C' or a == 'D' or a == 'E' or a == 'F' or a == 'G' or a == 'H' or a == 'I' or a == 'J' or a == 'K' or a == 'L' or a == 'N' or a == 'M' or a == 'O' or a == 'P' or a == 'Q' or a == 'R' or a == 'S' or a == 'T' or a == 'U' or a == 'V' or a == 'W' or a == 'H' or a == 'Y' or a == 'Z':
        print('A')
    else:
        print('a')


if __name__ == '__main__':
    main()

Solution (Python):
alpha = input()

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

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

Solution (Python):
inpt = input()
cap = {'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'}
if inpt in cap:
    print('A')
else:
    print('a')

Solution (Python):
alpha = input()

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

Solution (Python):
x=input()

if "A"<=x and x<="Z":
    print("A")
elif "a"<=x and x<="z":
    print("a")
else:
    print("")

Solution (Python):
s = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):
N = input()

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

Solution (Python):
a = input()

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

Solution (Python):
i = input()

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

Solution (Python):
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"}
a=input()
if a in L:
  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):


S = input()

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

Solution (Python):
ch = input()

if ord(ch) in range(97, 123):
    print("a")

else:
    print('A')

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

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

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

Solution (Python):
a=input()

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

a = input()

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