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

Solution (Python):

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

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

Solution (Python):
check_a = [chr(ord('a') + i) for i in range(26)]

s=input()

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

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

import sys
input = sys.stdin.readline

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

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

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

Solution (Python):

"""
Created on Sun Jun 21 20:47:20 2020

@author: NEC-PCuser
"""

c = input()

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

Solution (Python):

alp = input()
alp_s = alp.lower()

if alp == alp_s:
    print('a')
else:
    print('A')

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

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

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

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

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

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

Solution (Python):
A = input()

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

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

Solution (Python):

char = input()

flg = char.isupper()

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

Solution (Python):











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

Solution (Python):
a=input()

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

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

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

S=input()
aord=ord('a')

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

Solution (Python):
a = input()

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

else:
    print("A")

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()
print("a" if s in [x for x in "abcdefghijklmnopqrstuvwxyz"] else "A")

Solution (Python):
a = input()

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

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

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

Solution (Python):
from string import ascii_uppercase


a = input()
if a in ascii_uppercase:
    print("A")
else:
    print("a")

Solution (Python):

from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

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


def main():
	alpha = input()
	if ord(alpha) <= 90:
		print("A")
	else:
		print("a")


if __name__ == '__main__':
	main()

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Solution (Python):
a=input()
l=[i for i in "ABCDEFGHIJKLMNOPQRSTUVWXYZ"]
if a in l:
  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):
import sys


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


def main():
    c = _s()
    return 'A' if 65 <= ord(c) <= 90 else 'a'


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

Solution (Python):
from sys import stdin, setrecursionlimit


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


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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



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

Solution (Python):
import sys
import time




import math
start=time.time()
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**18
MOD = 1000000007
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
a=rs()
if a==a.lower():
    print("a")
else:
    print("A")

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

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

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

Solution (Python):
s = input()

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

Solution (Python):





import sys
import heapq

def main():
    n = input()
    if n in "abcdefghijklmnopqrstuvwxyz":
        print("a")
    else:
        print("A")
    return

if __name__ == "__main__":
    main()

Solution (Python):
for _ in range(1):
    s=input()
    if(ord(s[0])>=65 and ord(s[0])<=90):
        print('A')
    else:
        print('a')

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

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

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

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

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

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

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

resolve()

Solution (Python):

S = input()

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

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

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

Solution (Python):
"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7

a = input()

c = ord(a)

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

Solution (Python):
def resolve():
    S = input()

    if (S.islower()):
        print('a')
        return

    print('A')


resolve()

Solution (Python):

import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


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

    return


if __name__ == '__main__':
    main()

Solution (Python):

N = input()
A = N.upper()

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

Solution (Python):

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
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"]

S=input()
if S in a:
    print("a")
else:
    print("A")

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

resolve()

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

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

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

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

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    a = gete()

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys

class alphabet: 
    def __init__(self, capitalize):
        self.num = dict() 
        self.abc = ["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 capitalize: 
            for i in range(26): self.abc[i] = self.abc[i].upper()
        for i, a in enumerate(self.abc): self.num[a] = i


def solve():
    a = input()
    AB = alphabet(False)
    if a in AB.abc: print("a")
    else: print("A")

    return 0

if __name__ == "__main__":
    solve()

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

Solution (Python):
import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()
    DD = ((1,0),(0,1),(-1,0),(0,-1))

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


if __name__ == '__main__':
    main()

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

Solution (Python):

import numpy as np
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect


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


def z():
    return int(input())


def S():
    return input()


def C(line):
    return [input() for _ in range(line)]


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

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

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

Solution (Python):



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

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

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

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

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

Solution (Python):
s = input()

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter

from functools import lru_cache

sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


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

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

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

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

Solution (Python):
A = input()

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

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

Solution (Python):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():
    s = in_s()

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

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

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

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

Solution (Python):
a = input()
a_ = a.lower()
if a == a_:
    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):
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().strip()
print("a" if a in "abcdefghijklmnopqrstuvwxyz" 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):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = ns()

if ord(a) > 96:
    print('a')
else:
    print('A')

Solution (Python):
def main():

    S = input()
    
    if S in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
        return 'A'
    return 'a'


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

Solution (Python):
import itertools
import decimal
import math
import collections
import sys
input = sys.stdin.readline



N=(input())




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

Solution (Python):
A = input()

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

Solution (Python):

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

input = sys.stdin.readline

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

inf = float('inf')
mod = 1000000007




def main():
	A = inputStr()

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





if __name__ == "__main__":
	main()

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

Solution (Python):
char = input()
big = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
small = 'abcdefghijklmnopqrstuvwxyz'

if char in big:
    print('A')
else:
    print('a')

Solution (Python):
def solve(s):
    if s.upper() == s:
        return "A"
    else:
        return "a"


def main():
    s = input()
    res = solve(s)
    print(res)


def test():
    assert solve("B") == "A"
    assert solve("a") == "a"


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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):
def main():
    x = input().strip('\n')
    if 'A' <= x <= 'Z':
        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(a.islower()):
    print('a')
else:
    print('A')

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

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

Solution (Python):
a = input()

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

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

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

print(main())

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

Solution (Python):
S = input()

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

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

Solution (Python):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) 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 II(): return int(sys.stdin.readline())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res

C=input()

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
if s in 'ABCDEFGHIJKLMOPQRSTUVWXYZ':
  print('A')
else:
  print('a')

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

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    s = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

s = input()










s_low = s.lower()

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

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

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

Solution (Python):
k = "abcdefghijklmnopqrstuvwxyz"
o = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

if input() in o:
    print("A")
else:
    print("a")

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

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

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

Solution (Python):
a = input()

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

Solution (Python):
a = input()

if 97<=ord(a)<=97+26:
    print("a")
else:
    print("A")

Solution (Python):



import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

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

Solution (Python):
def main():
    DAI="QWERTYUIOPLKJHGFDSAZXCVBNM"
    a=input()
    if a in DAI:
        print("A")
    else:
        print("a")
if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools

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

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

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

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

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

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

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def main():
    a = IS()
    if a.islower():
        print('a')
    else:
        print('A')

if __name__ == '__main__':
    main()

Solution (Python):
a = input()

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

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

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

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

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

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

Solution (Python):
def check():
    S = input()
    if S==S.lower():
        return 'a'
    return 'A'
print(check())

Solution (Python):
A = input()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)


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


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

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

Solution (Python):

import bisect
import collections
import sys

sys.setrecursionlimit(1000000)
ACMOD = 1000000007
INF = 1 << 62




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

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

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

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

Solution (Python):

import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"




c = input()
if ord(c) >= 97:
	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):
import sys
import math
def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
s = SI()
if s.islower():
	print("a")
else:
	print("A")

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

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

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

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

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

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

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

Solution (Python):
from string import ascii_letters, ascii_lowercase, ascii_uppercase

ch = input().rstrip()

if ch in ascii_uppercase:
    print('A')
else:
    print('a')

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

def main():
    n = input().strip()
    if n.islower():
        print('a')
    else:
        print('A')

if __name__ == '__main__':
    main()

Solution (Python):
a = input()

if 'A' <= a <= 'Z':
    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):
def main():
    import sys
    input = sys.stdin.readline
    s = input().strip()
    if ord(s) < 97:
        print('A')
    else:
        print('a')

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
s = input()

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