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:
letter = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if ord("a") <= ord(x) <= ord("z"):
    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:
n = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = ord(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
import re
print('A' if re.match(r'[A-Z]', s) else '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 ord(a) >= 65 and ord(a) <= 90:
    print('A')
else:
    print('a')

Submission status: Accepted

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

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 >= 'a' and a <= 'z':
    print('a')
else:
    print('A')

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


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


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

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

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

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

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

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

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

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

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

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



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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
A = input()
print("a" if A > 'Z' else "A")

Submission status: Accepted

Solution code:
n = str(input())

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

main()

Submission status: Accepted

Solution code:
str = input()
if(str.islower()):
  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:
str=input()
if str.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 = input()
print("A" if a in "ABCDEFGHIJKLMNOPQRSTUVWXYZ" else "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:
N = input()
if N.isupper():
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:


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

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

    # a_set = set()
    # duplicate = set()
    # for a in input().rstrip().split():
    #     a = int(a)
    #     if a in a_set:
    #         duplicate.add(a)
    #     else:
    #         a_set.add(a)

    # a_list = list(a_set)
    # a_list.sort()

    # answer = 0
    # divisors = set()
    # for a in a_list:
    #     judge = True
    #     for divisor in divisors:
    #         if a % divisor == 0:
    #             judge = False
    #             break
    #     if judge:
    #         divisors.add(a)
    #         if a in duplicate:
    #             continue
    #         answer += 1

    # print(answer)


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
s = str(input(""))
new_s = s.upper()
if s == new_s:
    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()
if ord(s)>=ord("A") and ord(s)<=ord("Z"):
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
s = input()

low=s.lower()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
# print(string.ascii_uppercase)
# print(string.ascii_lowercase)
if input() in string.ascii_uppercase:
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
a = input()

b = a.upper()

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

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
S=input()
if ord(S)>=97:
  print("a")
else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
def main():
    inp = input()
    if re.match(f'[A-Z]',inp):
        print("A")
    else:
        print("a")
    return 

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=input()
hoge="abcdefghijklmnopqrstuvwxyz"
huga="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
if(n in hoge):
  print("a")
if(n in huga):
  print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    s = input()
    x = ord(s)
    if (ord('A') <= x) and (x <= ord('Z')):
        print('A')
    else:
        print('a')
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
I = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())

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

Submission status: Accepted

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

a = input()
if a.isupper():
    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:
n = input()
dic = {'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}
if n in dic:
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
a = ord(input())

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = input()

alf = [
    '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 alf:
    print('A')
else:
    print('a')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import math
from collections import Counter

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
def main():
    a = input()
    print("A" if a.isupper() else "a")

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
import bisect as bs
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
def adj(n): return [[] for _ in range(n)]

s = sinput()
ans = "A" if s.isupper() else "a"
print(ans)

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:
a = input()
mojiretu = "abcdefghijklmnopqrstuvwxyz"
if a in mojiretu:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
def main():
    a = input()
    if "a" <= a <= "z":
        print("a")
    else:
        print("A")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = input()
a_1 = 'abcdefghijllmnopqrstuvwxyz'
A_1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
if a in a_1:
  print('a')
elif a in A_1:
  print('A')

Submission status: Accepted

Solution code:
# cook your dish here
s=input()
if s.isupper():
    print('A')
elif s.islower():
    print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if ord(s)<=122 and ord(s)>=97:
    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:
def main():
    a = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input()
    alphabets = [chr(ord("a") + x) for x in range(26)]
    if s in alphabets:
        print("a")
    else:
        print("A")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]


a = str(input())
if(a.isupper()):
  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:
def resolve():
    a = input()
    if a >= 'a' and a <= 'z':
        print('a')
        return
    print('A')

resolve()

Submission status: Accepted

Solution code:
li = ["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 li:
    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()
print('A' if a.lower()!=a else 'a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = input()
li = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

if A in li:
    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:
import sys
sys.setrecursionlimit(10**9)

def main():
    n = input()

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


if __name__ == "__main__":
    main()
    sys.exit(0)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
	return list(map(int,input().split()))
def m(): #複数文字
	return map(int,input().split())
def onem(): #Nとかの取得
	return int(input())
def s(x): #圧縮
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): #listをスペースごとに分ける
	return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
	return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

s = input()[:-1]

po = ord(s) - 97

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

Submission status: Accepted

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



    

 
    
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if input() in [chr(i) for i in range(65, 65+26)]:
  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:
t = input()

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

Submission status: Accepted

Solution code:
line = input()

if (line.isupper()):
    print("A")
else:
    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()
change = alpha.upper()
if alpha == change:
    print('A')
else:
    print('a')

Submission status: Accepted

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

c = input()

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

Submission status: Accepted

Solution code:
a = input()
if ord(a) <= 97+25 and ord(a) >= 97:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
temp = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
alpha = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if(ord(s[0])>=65 and ord(s[0])<97):
  print('A')
else:
  print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): 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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    c=SI()
    if ord(c)>=97:print("a")
    else:print("A")

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

L = string.ascii_uppercase

s = input()
f = s in L

print(['a', 'A'][f])

Submission status: Accepted

Solution code:
X = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
a = input()
if a in X:
    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:
w = input()
print("a" if w.islower() else "A")

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    i = input()
    if i.lower() == i:
        print("a")
    else:
        print("A")

    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

t=s.upper()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
#n = int(input())
#x, y = map(int, sys.stdin.readline().split())
s = input()
#a = list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
def main():
    from builtins import int, str, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
s=str(input())
if(ord(s[0])>=65 and ord(s[0])<97):
  print("A")
else:
  print("a")