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 .

Solution (Python):
a = input()

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

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

Solution (Python):
a = input()

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    a = input()
    if 'a' <= a <= 'z':
        print('a')
    else:
        print('A')
resolve()

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    a = input().rstrip()

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

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    s = input()
    if s.isupper():
        print("A")
    else:
        print("a")

if __name__ == '__main__':
    main()

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

Solution (Python):
FAST_IO = 0
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())
rrmm = lambda n: [rrm() for _ in xrange(n)]



from collections import defaultdict as ddic


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