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:

import glob
import os

bn = os.path.basename(__file__).split('.')[0]
dn = os.path.dirname(__file__).split('/')

# 問題ごとのディレクトリのトップからの相対パス
REL_PATH = dn[len(dn)-2] + '\\' + dn[len(dn)-1] + '\\' + bn

# テスト用ファイル置き場のトップ
TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):

        s = self.input_data()
        if s in "abcdefghijklmnopqrstuvwxyz":
            print("a")
        else:
            print("A")


solver = Solver(REL_PATH)
solver.exec_resolve()

Submission status: Accepted

Solution code:
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int #整数
float #小数

#for
for name in fruits: #fruitの頭から操作
    print(name)

#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1= [i for i in range(10)] #>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
number=[int(input()) for i in range(int(input()))] #複数行の入力をリストに
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト(文字列も可）内の2の数
list1.sort() #並び替え小さい順
list1.sort(reverse=True)  #並び替え大きい順
set(list1) #list1内の重複している要素を削除し、小さい順に並べる
sum([2,3,   ,3]) #リストの合計

abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値
text1 = text1.replace("34","test") #text1内の"34"を"test"に書き換える(文字列内の文字を入れ替える)
sorted(S) #Sを辞書順にソート
exit(0) #強制終了

cumsum(リスト) #累積和をリストで返す
cumsum_number(N,K,x) #N個の数が含まれるリストx内のK個からなる部分和をリストで返す
"""
N=input()
if N=="A" or N=="B" or N=="C" or N=="D" or N=="E" or N=="F" or N=="G" or N=="H" or N=="I" or N=="J" or N=="K" or N=="L" or N=="M" or N=="N" or N=="O" or N=="P" or N=="Q" or N=="R" or N=="S" or N=="T" or N=="U"or N=="V"or N=="W"or N=="X" or N=="Y" or N=="Z":
    print("A")
else: print("a")

Submission status: Accepted

Solution code:
x: str = input()

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


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)]


sys.setrecursionlimit(1000000)
mod = 1000000007


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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
    Satwik_Tiwari ;) .
    20 june , 2020  - Tuesday
"""

#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase


import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
#If the element is already present in the list,
# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect
#If the element is already present in the list,
# the right most position where element has to be inserted is returned

#==============================================================================================

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)

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

#===============================================================================================
#some shortcuts

mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var))  #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  #as stdout.write always print sring.
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) : # Check Prime Number or not
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True

#===============================================================================================
# code here ;))


def solve():
    s = inp()
    string = s
    if(string.isupper()):
        print('A')
    else:
        print('a')


testcase(1)
# testcase(int(inp()))

Submission status: Accepted

Solution code:
# coding: utf-8
S=input()
S2=S[0]
S2=S2.upper()
if S==S2:
    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:
#-*-coding:utf-8-*-

import sys

def main():
    n = input()
    if str.islower(n)==True:
        print("a")
    else:
        print("A")
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

temp = S
if temp == S.upper():
    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())

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

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

Submission status: Accepted

Solution code:
input_str = input()

if input_str.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:
import sys

def input(): return sys.stdin.readline().strip()
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 INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

S = input()

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

Submission status: Accepted

Solution code:
a = input()

if ord(a) >= ord('a') and ord(a) < ord('a')+26:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

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

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

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

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

s = S()

al = [ chr(ord('a') + i) for i in range(26) ]
# AL = [ chr(ord('A') + i) for i in range(26) ]

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

Submission status: Accepted

Solution code:
#%%
N = input()

if N == N.upper():
    print("A")

else:
    print("a")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


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


if __name__ == '__main__':
    main()

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']
a = input()
if a in alpha:
  print('a')
elif a.lower() in alpha:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

char = input()

if char in string.ascii_uppercase:
  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  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    C = input()
    if ord(C)>=ord('A') and ord(C)<=ord('Z'):
        print('A')
    else:
        print('a')

    return

    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alpha = ord(input())

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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


main()

Submission status: Accepted

Solution code:
t = input()
# nums = map(int, input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A = input()
if A.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:
alpha2num = lambda c: ord(c) - ord('A') + 1
if alpha2num(input())>=33:
  print("a")
else:
  print("A")

Submission status: Accepted

Solution code:
s = input()
ord_s = ord(s)
if ord_s <= 90:
    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:
n = input()

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

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    n = input()
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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

resolve()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
if ord(a) < 0x61:
    print('A')
else:
    print("a")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#<ABC.171>
n = input()
if n.islower():
    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:
upper = "QWERTYUIOPASDFGHJKLZXCVBNM"

A = input()

print('A' if A in upper else 'a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = input()

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

Submission status: Accepted

Solution code:

alpha = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = str(input())

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

Submission status: Accepted

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

def main():
    n = input()
    p = re.compile('[a-z]+')
    if p.fullmatch(n):
        print('a')
    else:
        print('A')

def count_tento(l, cur):
    count = 0
    for v in l:
        if v > cur:
            count += 1
    return count

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

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=input()
X=["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
if N in X:
  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:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    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']
    x = input()
    if x in l:
        print('a')
    else:
        print('A')

main()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")

MOD = 1000000007
INF = float('inf')

def keta(kazu): # 入力されたintを桁ごとに分解，リストで出力
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers): # 最小公倍数
    return reduce(math.gcd, numbers)

def combination(m,n): # mCn
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  # (x**n)の計算の高速化
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
    return K * x
    
def main():
    s = stdin.readline().rstrip()
    if s.isupper():
        print("A")
    else:
        print("a")
main()

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
S = input()

if str.islower(S):
  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()

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

Submission status: Accepted

Solution code:
s=input()
s1=s.upper()
if s==s1:
    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  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    # Failed to predict input format
    al = input()
    if al.isupper():
        print("A")
    else:
        print("a")
    return
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

        return ans

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

Submission status: Accepted

Solution code:
N=input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline

X = str(input().split())

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

else:
    print("a")

Submission status: Accepted

Solution code:
x = input()
if(x.isupper()):
  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:
def solve():
    a = input()

    if a in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
        return 'A'
    else:
        return 'a'


print(solve())

Submission status: Accepted

Solution code:
x = input()
S = 'abcdefghijklmnopqrstuvwxyz'
if x in S:
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())
cap = [chr(i) for i in range(97, 97+26)]
CAP = [chr(i) for i in range(65, 65+26)]
if a in CAP:
    print('A')
if a in cap:
    print('a')

Submission status: Accepted

Solution code:
#N = int(input())
#A = list(map(int, input().split()))
#a, b = map(int, input().split())
N = input()

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

Submission status: Accepted

Solution code:
def main():
    import sys
    #int(sys.stdin.readline())
    s = sys.stdin.readline().rstrip()
    #map(int, sys.stdin.readline().split())
    A = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    a = 'abcdefghijklmnopqrstuvwxyz'
    if s in A:
        print('A')
    elif s in a:
        print('a')




if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

w='abcdefghijklmnopqrstuvwxyz'

W='ABCDEFGHIJKLMNOPQRSTUVWXYZ'

if a in w:
    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:
a = str(input())

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

else:
    print('a')

Submission status: Accepted

Solution code:
alpha = input()

x = alpha.lower()

if alpha == x:
  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:
s = input()


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

Submission status: Accepted

Solution code:
inp=str(input())

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

print(ans)

Submission status: Accepted

Solution code:
letter = input()
if letter.isupper():
    print("A")
elif letter.islower():
    print("a")

Submission status: Accepted

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

Submission status: Accepted

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