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

num = ord(a)

if 65 <= num <= 96:
    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.upper() == a:
    print('A')
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline

#n,m = map(int,readline().split())

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

Submission status: Accepted

Solution code:
s = input()

s2=s.upper()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
n=input()
if(ord(n)>=65 and ord(n)<=90):
    print("A")
else:
    print("a")

Submission status: Accepted

Solution code:
a = input()
b = a.isupper()

if b == 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:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    ss=readline().rstrip()
    if ss==ss.lower():
        print("a")
    else:
        print("A")
    #yn(1)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Accepted

Solution code:
a = input()

ans = "A"

if a.islower():
    ans = "a"
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
if 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:
A=input()

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

Submission status: Accepted

Solution code:
# ABC171 A 

a = input()
u_a = a.upper()

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

Submission status: Accepted

Solution code:
import numpy as np

a=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

a = input().rstrip()

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
a = input()

A = a.upper()

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

Submission status: Accepted

Solution code:

#!/usr/bin/python
# -*- coding: utf-8 -*-

import numpy as np

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve(test_def_name=""):
    # 数値取得サンプル
    #   1行1項目 n = int(input())
    #   1行2項目 x, y = map(int, input().split())
    #   1行N項目 x = [list(map(int, input().split()))]
    #   N行1項目 x = [int(input()) for i in range(n)]
    #   N行N項目 x = [list(map(int, input().split())) for i in range(n)]

    # 文字取得サンプル
    #   1行1項目 x = input()
    #   1行1項目(1文字ずつリストに入れる場合) x = list(input())
    a = input()
    if a == a.upper():
        print("A")
    else:
        print("a")


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """B"""
        output = """A"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """a"""
        output = """a"""
        self.assertIO(test_input, output)

    # 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import string
a = input()
alf = string.ascii_lowercase
if a in alf:
    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:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np
# from numpy import cumsum  # accumulate

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A - αlphabet
a = input()
if str.isupper(a):
    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
def input(): return sys.stdin.readline().rstrip()

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 in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
    print('A')
else:
    print('a')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import bisect
import numpy as np
import math
from collections import deque
from collections import defaultdict
from math import gcd




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

Submission status: Accepted

Solution code:
a = str(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if ord(input()) > 90:
    print('a')
else:
    print('A')

Submission status: Accepted

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

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''
    A = input()

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
#1問目
a = input()
if a.isupper() == True:
    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:
ch=(input())
if(ch.isupper()):
    print("A")
elif(ch.islower()):
    print("a")

Submission status: Accepted

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

s=input()

if s in check_a:
    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:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 21 20:47:20 2020

@author: NEC-PCuser
"""

c = input()

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

char = input()

flg = char.isupper()

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

Submission status: Accepted

Solution code:
#import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
#import collections as C #most_common

#N = int(input())
#X,N= map(int,input().split())
#P = list(map(int,input().split()))
S= str(input())
if S.isupper()==True:
    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:
S = input()
if S.isupper():
    print("A") 
else:
    print("a")

Submission status: Accepted

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

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

if ord(S[0]) < aord:
  print('A')
else:
  print('a')
#A=list(map(int,input().split()))
#print(A)

Submission status: Accepted

Solution code:
a = input()

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

else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=str(input())
if str.isupper(a)==True:
  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:
from string import ascii_uppercase


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

Submission status: Accepted

Solution code:

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

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

#処理内容
def main():
	alpha = input()
	if ord(alpha) <= 90:
		print("A")
	else:
		print("a")


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input()
l=[i for i in "ABCDEFGHIJKLMNOPQRSTUVWXYZ"]
if a in l:
  print("A")
else:
  print("a")

Submission status: Accepted

Solution code:
import sys


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


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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
# N = I()
# A = [LI() for _ in range(N)]

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

Submission status: Accepted

Solution code:
import sys
import time
#from collections import deque, Counter, defaultdict
#from fractions import gcd
#import bisect
#import heapq
import math
start=time.time()
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**18
MOD = 1000000007
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
a=rs()
if a==a.lower():
    print("a")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print('A' if s.isupper() else'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:
# Contest No.: ABC171
# Problem No.: A
# Solver:      JEMINI
# Date:        20200621

import sys
import heapq

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
for _ in range(1):
    s=input()
    if(ord(s[0])>=65 and ord(s[0])<=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:
s=input()
if s.isupper()==True:
  print('A')
else:print('a')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if s.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:
a = input()

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""    Arnab Chanda    """

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

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

a = input()

c = ord(a)

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

Submission status: Accepted

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

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

    print('A')


resolve()

Submission status: Accepted

Solution code:
#!/us/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = input()
if n.islower():
    print('a')
else:
    print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**8)


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


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


def main():
    a = gete()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

class alphabet: #Trueなら大文字
    def __init__(self, capitalize):
        self.num = dict() #アルファベットを数字に変換
        self.abc = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n"\
            ,"o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
        if capitalize: 
            for i in range(26): self.abc[i] = self.abc[i].upper()
        for i, a in enumerate(self.abc): self.num[a] = i


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

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys,queue,math,copy,itertools,bisect,collections,heapq

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect


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


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


def S():
    return input()


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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def main():
    #a,b=map(float,input().split())
    #a=int(a)
    #rint(int((b*100)*a//100))
    a=input()
    if a>="a":
        print("a")
    else:
        print("A")
main()

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


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


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


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


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

Submission status: Accepted

Solution code:
A = str(input())
if A.isupper():
  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()
b = a.upper()
if a==b:
    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:
A = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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


def main():
    s = in_s()

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = ns()

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

Submission status: Accepted

Solution code:
def main():

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


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

Submission status: Accepted

Solution code:
import itertools
import decimal
import math
import collections
import sys
input = sys.stdin.readline



N=(input())

# ListA=list(map(int,input().split()))
# ListA.sort()#reverse=True)

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