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.



Sample input:
B


Sample output:
A

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    print('A') if s.isupper() else print('a')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = str(input())
m = [chr(i) for i in range(65, 65+26)]

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

Submission status: Accepted

Solution code:
p = input()
flag=0
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"]
for i in L:
    if p == i:
        flag +=1
if flag == 0:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
a = str(input())
b = a.upper()
c = a.lower()
if b == a :
    print("A")
if c == a :
    print("a")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alpha = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 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"]
B = ["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.count(S)>B.count(S):
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def alphabet(s):
    if ord(s) in range(97,123):
        return "a"
    return "A"

if __name__ == "__main__":
    s = input()
    print(alphabet(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
list_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 a in list_a:
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
c = (input())
if (c[0].islower()):
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
import re
a = input()
if re.fullmatch(r'[a-z]', a):
    print('a')
else:
    print('A')

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
s = input()


if s < 'a':
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
a = input() #ここで標準入力

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
S =input().strip()
big   ="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
small ="abcdefghijklmnopqrstuvwxyz"
if S in big:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
ch = input()

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

Submission status: Accepted

Solution code:
n = input()

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

elif n.islower():
  print('a')

Submission status: Accepted

Solution code:
a = input()
c = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
if a in c:
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = str(input())

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

Submission status: Accepted

Solution code:
c = input()
#l = input().split(" ")
#l = list(map(int,l))
a = [chr(ord("a")+i) for i in range(26)]

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

Submission status: Accepted

Solution code:
import string

A = input()



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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
alpha = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
c = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'

a=input()

for i in range(52):
    if c[i]== a:
        if i > 25:
            print("A")
        else:
            print("a")
        exit(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
alpha = stdin.readline().rstrip()
if alpha.islower():
  print('a')
else:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b = input()
ans = b.islower()
if ans == True:
  print('a')
else:
  print('A')

Submission status: Accepted

Solution code:
s = input()
t = s.capitalize()
if s == t :
    print("A")
else :
    print("a")

Submission status: Accepted

Solution code:
import operator as op
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import reduce
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

# For getting input from input.txt file
# sys.stdin = open('input.txt', 'r')

# Printing the Output to output.txt file
# sys.stdout = open('output.txt', 'w')


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


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


def def_value():
    return 0


s = input()

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

Submission status: Accepted

Solution code:
alphabet=input() # 入力アルファベット

if alphabet.isupper(): # 入力アルファベットが大文字のとき
    print("A")
else: # 小文字のとき
    print("a")

Submission status: Accepted

Solution code:
a=str(input())
ans = "a"
if a.isupper():
    ans = "A"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if ord(input()) < 91:
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:

def main():
    a = input()

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

main()

Submission status: Accepted

Solution code:
a=input()
if  65<=ord(a)<=90:
    print("A")
elif 97<=ord(a)<=122:
    print("a")

Submission status: Accepted

Solution code:
x = str(input())

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

Submission status: Accepted

Solution code:
a = input()
small = list(range(ord("a"), ord("z")+1))
big = list(range(ord("A"), ord("Z")+1))
if ord(a) in small:
  print("a")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = 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 word in A:
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = ['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']

for i in range(26):
    if b[i] == a:
        print('A')
        break
    elif i == 25:
        print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
num=ord(a)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力の取得
alpha = str(input())

# 求解処理
ans = str()
if alpha.isupper():
    ans = "A"
elif alpha.islower():
    ans = "a"

# 結果出力
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()

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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
if input().istitle() == True:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
GETA=12
#import sys,os,multiprocessing
#print(3)
###############################################################################
#FINDING THE MEDIAN OF N CONS
#CHOIANS
s=input()
if s.isupper():
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
import re
a = input()
if a < 'a':
    print("A")
else :
    print("a")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    x = input()
    if x.isupper():
        print("A")
    else:
        print("a")

Submission status: Accepted

Solution code:
import re

a=input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
print('Aa'[input()>'Z'])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import collections
# c = collections.Counter()
#import itertools as it
#import math
#import numpy as np
#import sys 
#sys.exit()
 
a = input()

#k = int(input())
#a, b  = map(int, input().split())
'''
#  = list(map(int, input().split()))
'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''
 
#-------------------------------#
#len(t)==len(s)+1
#print(t[0:-1])
if a.isupper()==True:
	print('A')
else:
  	print('a')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
#-------------------------------------

c = list(input())
if c[0].islower():
     result = "a"
else:
     result = "A"

print( result )

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
a=input()
if ord(a)>96:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
a = input()

b=a.islower()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
ls = 'qazwsxedcrfvtgbyhnujmikolp'
if x in ls:
    print('a')
else:
    print('A')

Submission status: Accepted

Solution code:
def solve():
	C = input()
	if ord('a') <= ord(C) and ord('z') >= ord(C):
		return "a"
	else:
		return "A"

def main():
	# for _ in range(int(input())):
	print(solve())


if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
import re

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


main()

Submission status: Accepted

Solution code:
print(['a','A'][ord(input())<96])

Submission status: Accepted

Solution code:
# import math
# from collections import Counter

# N = int(input()) # 1行, 単数
# arg = list(map(int, input().split())) # 1行, 配列
# D = Counter(arg) # 出現数カウント

# print('Yes')
# print('No')
# print()

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

Submission status: Accepted

Solution code:
s = ord(input())
if(s//32 == 2):
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
import re
a=input()
if re.sub(r'[A-Z]',"",a)=="":
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
z=[]
a=input()
z.append(a)
for i in z:
    if i.islower():
        print('a')
    else:
        print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

l = string.ascii_lowercase
u = string.ascii_uppercase

n = input()

if n in l:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
from sys import stdin

A = stdin.readline().strip()

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

Submission status: Accepted

Solution code:
alpha=input()
ans="a"
lista=["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 lista:
    ans="A"
print(ans)

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
LL = str(input())
frag =True
for i in range(97,97+26):
    if LL == str(chr(i)):
        frag = False

if frag == False:
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:





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

Submission status: Accepted

Solution code:
s = input()
#大文字
if s.isupper():
  print("A")

else:
  print("a")

Submission status: Accepted

Solution code:
s=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")

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def S():
    return input().rstrip()


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


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


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

Submission status: Accepted

Solution code:
alpha = input()
if ord("A") <= ord(alpha) and ord(alpha) <= ord("Z"):
    print("A")
elif ord("a") <= ord(alpha) and ord(alpha) <= ord("z"):
    print("a")

Submission status: Accepted

Solution code:
alpha=input()

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

Submission status: Accepted

Solution code:
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']

small = [i.lower() for i in large]

if alpha in large:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
import sys
si = sys.stdin.readline


def main():
    c = si()[0]
    if c in 'abcdefghijklmnopqrstuvwxyz':
        print('a')
    else:
        print('A')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a =input()

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

Submission status: Accepted

Solution code:
a=input()
flg=a.islower()

if flg == False:
    print("A")
else:
    print("a")

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = input()
if(a.islower() == True):
    print('a')
elif(a.islower() == False):
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c =  input()

if c.isupper() == 1:
    print('A\n')
else:
    print('a\n')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

c = sys.stdin.readline().rstrip('\n')

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))

'''
a=[]
b=[]
for i in range():
    A, B = map(int, input().split())
    a.append(A)
    b.append(B)'''

s=ord(input().rstrip("\n"))


for i in range(65,97):
    if s==i:
        print("A")
        sys.exit()
print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()



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

Submission status: Accepted

Solution code:
a=input()

f=ord(a)
print('a' if f>= 97 and f<=122 else 'A' )

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict

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

Submission status: Accepted

Solution code:
a = input()

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

else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
if a >= 'a' and a <='z':
  print('a')
if a >= 'A' and a <='Z':
  print('A')

Submission status: Accepted

Solution code:
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=="m" or a=="n" 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=="x" or a=="y" or a=="z":
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
import math
import sys

S = input()
        


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re

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

Submission status: Accepted

Solution code:
s = input()

import re

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#, = map(int, input().split(" "))
alpha = input()
komoji_list = ['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 komoji_list:
    print('a')
else:
    print("A")

Submission status: Accepted

Solution code:
X=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
def alphabet():

    alphabet = str(input())

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

if __name__ == '__main__':
    alphabet()

Submission status: Accepted

Solution code:
n=input()
a=n
a=a.upper()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
al = list("abcdefghijklmnopqrstuvwxyz")
AL = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
if a in al:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
import sys

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

def main():
    A = input()
    if A.isupper() == 1:
        print("A")
        return
    if A.isupper() == 0:
        print("a")



main()

Submission status: Accepted

Solution code:
alpha = input()

if 97 <= ord(alpha) <= 122:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
import string

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input("")

L = [i for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ']
l = [i for i in 'abcdefghijklmnopqrstuvwxyz']

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

Submission status: Accepted

Solution code:
a = input()

ord_a = ord(a)

if ord_a < 95:
    print("A")
else:
    print("a")