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:
c = input()
if ord("A") <= ord(c) <= ord("Z"):
    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:
a = input()

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
a = input()
if(ord(a)<97):
    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:
S = input()
if S == S.upper():
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def resolve():
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")
        
if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

a = input()
al = [chr(i) for i in range(97, 97+26)] # 英小文字
if a in al:
    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 = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mi():
    return map(int, input().split())

def ii():
    return int(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list_lower = ['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']
list_upper = ['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[0] in list_lower:
    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:
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7


Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
# for use in beginner level contests where speed is key
a = input()
if not a.lower() == a:
  print("A")
else:
  print("a")

Submission status: Accepted

Solution code:
s = input()
if s == s.lower():
    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:
#K = int(input())
#X = list(map(int, input().split()))
#s = input().split()

S = input()

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

Submission status: Accepted

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

sys.setrecursionlimit(500005)
stdin = sys.stdin

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

s = ns()
if s >= "A" and s <= "Z":
    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:
a=input()
l=[chr(i) for i in range(97,97+26)]
if a in l:
  print('a')
else:
  print('A')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from string import ascii_lowercase as c
print("a" if input() in c else "A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_lowercase
s = input()
if s[0] in ascii_lowercase:
    print("a")
else:
    print("A")

Submission status: Accepted

Solution code:
# H, W = [int(_) for _ in input().split()]
a = input()
if a.isupper():
  print('A')
else:
  print('a')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

a = rs()

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

Submission status: Accepted

Solution code:
print 'aA'[raw_input().isupper()]

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import *

s = input()[:-1]

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = input()[: -1]
if S.isupper(): print("A")
else: print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

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

Submission status: Accepted

Solution code:
import sys 
input = lambda:sys.stdin.readline().strip()
c = input()
if c.isupper():
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
a=input()
if(a.isupper()):
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
#n = int(input())
s = input()
#arr = list(map(int, input().split()))
#i, j = map(int, input().split())
#x, y, z = map(int, input().split())
#i, j, k , l = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    S = SI()
    if S in alphabet:
        ans = "a"
    else:
        ans = "A"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限

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

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a = input()

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


if __name__ == '__main__':
    main()

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:
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
# import heapq
import decimal
# import statistics
import queue

# import numpy as np

sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
print("{}".format("A" if S.isupper() else "a"))

Submission status: Accepted

Solution code:
a=input()
num=ord(a)
if num<92:
    print("A")
else:
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

a = input()

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

Submission status: Accepted

Solution code:
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
 
s = rr()
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:
a=input()
if ord("A")<=ord(a)<=ord("Z"):
	print("A")
else:
	print("a")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    A = input()
    if A == A.lower():
        print('a')
    else:
        print('A')
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def solve():
    A = readline().rstrip()
    if ord('a') <= ord(A) <= ord('z'):
        print('a')
    else:
        print('A')

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	s = S()
	if s.upper() == s:
		print('A')
	else:
		print('a')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np
#from decimal import *

a = input()

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a = input()
if 'a' <= a <= 'z':
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def read():
    A = input().strip()
    return A,


def solve(A):
    return "a" if A.lower() == A else "A"


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'

s = input()
if s in ALP:
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
s = input() #sys.stdin.readlineは最後が改行

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

Submission status: Accepted

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