Problem:
 Score : 100 points    Problem Statement It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2 .  Given an integer r , find the area of a regular dodecagon inscribed in a circle of radius r .      Constraints  1 \leq r \leq 100  r is an integer.         Input Input is given from Standard Input in the following format:  r       Output Print an integer representing the area of the regular dodecagon.        Sample Input 1 4      Sample Output 1 48  The area of the regular dodecagon is 3 \times 4^2 = 48 .       Sample Input 2 15      Sample Output 2 675       Sample Input 3 80      Sample Output 3 19200

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
a = int(input())
print(3*a*a)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
r=int(input())

print(3*r*r)

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
n=int(input())
print(3*n**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print 3 * (int(raw_input()) ** 2 )

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(r**2 * 3)

Solution (Python):
r = int(input())

print(r**2 * 3)

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    r = int(input())
    print(3 * r ** 2)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
import sys


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

def main():
    r = int(input())
    print(3*r**2)
    
    

main()

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
def main():
    r = int(input())
    print(3*r**2)


if __name__ == '__main__':
    main()

Solution (Python):
print(3*int(input())**2)

Solution (Python):
a = int(input())
print(3*(a**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
a = int(input())
ans = 3*a*a
print(ans)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3* r**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):

def solve(r):
    return 3 * r ** 2

if __name__ == "__main__":
    print(solve(int(input())))

Solution (Python):
print(int(input())**2*3)

Solution (Python):


r = int(input())

print(3 * r ** 2)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    r = I()
    print(3 * r * r)

main()

Solution (Python):
r = int(input())
print (3*(r**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(r**2*3)

Solution (Python):
r = int(input())
print(3 * r**2)

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    
    r = int(input())
    print(3*(r**2))

if __name__ == "__main__":
    main()

Solution (Python):
def main():
  r = int(input())
  print(3*r*r)
main()

Solution (Python):
print(int(input())**2*3)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):

import sys


def solve(r: int):
    print(3 * r * r)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  
    solve(r)


if __name__ == '__main__':
    main()

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(r*r*3)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
print(3 * int(input())**2)

Solution (Python):
n=int(input())
print(3*n**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):



def main():
    r = int(input())
    print(3 * r**2)


if __name__ == '__main__':
    main()

Solution (Python):
r = int(input())
print(3*(r*r))

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
print(3*((int(input()))**2))

Solution (Python):
r = int(input())
print(3 * r**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
a = int(input())
print(3*a**2)

Solution (Python):
print( int(input()) ** 2 * 3)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3 * int(input())**2)

Solution (Python):
a = int(input())

print(3*(a ** 2))

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
a = int(input())
print(3 * a ** 2)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r = int(input())
print(r**2*3)

Solution (Python):
r = int(input())

ans = 3 * r * r
print(ans)

Solution (Python):
print(pow(int(input()), 2)*3)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
n=int(input())
print(3*n**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):

import sys
input = sys.stdin.readline









R = int(input())

print(3*R**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())

print(3*(r**2))

Solution (Python):
r = int(input())
R=3*r*r
print(R)

Solution (Python):
print(int(input()) ** 2 * 3)

Solution (Python):
N = int(input())
print(3*N**2)

Solution (Python):
S = int(input())

print(3*(S**2))

Solution (Python):

import sys
input = sys.stdin.readline
r = int(input())
S =3*r*r
print(S)

Solution (Python):
r = int(input())

print(3 * r**2)

Solution (Python):

r = int(input())
print(3 * r ** 2)

Solution (Python):
a = int(input())
print(a * a * 3)

Solution (Python):


r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):

print(3*(int(input())**2))

Solution (Python):
n = int(input())
print(3*n*n)

Solution (Python):
def dodecagon(r):

    return 3*(r**2)
def main():
    r = int(input())
    print(dodecagon(r))

if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
a=int(input())
r=3*a*a
print(r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r = int(input())
print (3*r*r)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r **2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
import sys

def main():
    R = int(input())

    ans = 3 * R * R
    print(ans)
    return


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

Solution (Python):
import itertools
import math
import fractions
import functools
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):




geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(input())

print(gete(lambda r: 3 * int(r)**2))

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
a = int(input())
b = int(3*a*a)
print(b)

Solution (Python):
a = int(input())
b = int(3*a*a)
print(b)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
import sys
import math
import bisect

def main():
    a = int(input())
    print(3 * a ** 2)
    
if __name__ == "__main__":
    main()

Solution (Python):
r = int(input())
print((r ** 2) * 3)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
r = int(input().rstrip())
print(3 * r * r)

Solution (Python):
r=int(input())
print(int(3*r*r))

Solution (Python):
a=int(input())
print(int(3*a*a))

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):


from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

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():
    r=ii()
    print(3*r*r)

main()

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):


r = int(input())
print(3 * r ** 2)

Solution (Python):
from math import pow
r = int(input())
print(3*int(pow(r, 2)))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
def ABC_134_A():
    r = int(input())
    print(int(3*r*r))

if __name__ == '__main__':

    ABC_134_A()

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())

ans = 3 * r ** 2
print(ans)

Solution (Python):
print((int(input())**2)*3)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


r = I()
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r=int(input())

print(3*(r**2))

Solution (Python):
r = int(input())
print(r*r*3)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
def solve():
    r = int(input())
    print(3*r**2)


solve()

Solution (Python):
print(int(input())**2*3)

Solution (Python):
def main():
    r = int(input())
    print(3*r*r)


if __name__ == "__main__":
    main()

Solution (Python):
i = int(input())
print(3*i*i)

Solution (Python):


print(3 * int(input()) ** 2)

Solution (Python):
a=int(input())
print(3*a**2)

Solution (Python):
import sys, heapq, bisect, math, fractions
from collections import deque

r = int(input())

print(3 * r ** 2)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
N = int(input())
print(3*N*N)

Solution (Python):
print(int(input())**2*3)

Solution (Python):

N = int(input())



print(3 * N * N)

Solution (Python):
import sys
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]

print(((ri()) ** 2) * 3)

Solution (Python):
print(int(input())** 2 * 3)

Solution (Python):
a = int(input())
print(3*pow(a,2))

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r = int(input())
print(3* r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r=int(input())
ans=3*(r**2)
print(ans)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
x = int(input())
print(3*(x**2))

Solution (Python):


print(3*(int(input())**2))

Solution (Python):
n = int(input())
print((n**2)*3)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):

r=int(input())
print(3 * (r**2))

Solution (Python):
x=input()
r=int(x)
print(3*r**2)

Solution (Python):
a=int(input())
print(3*a**2)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):


def main():
    r = int(input())

    print(3 * r * r)


main()

Solution (Python):
R = int(input())
print(3*R**2)

Solution (Python):
r = int(input())
print(3 * (r**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r=int(input())
ans=3*r**2
print(ans)

Solution (Python):
n = int(input())
print(int(3*n*n))

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):

r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
import math
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
dodecagon = int(input())
print(3*dodecagon*dodecagon)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input().strip('\n'))
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
print((int(input())**2)*3)

Solution (Python):
print(3 * int(input())**2)

Solution (Python):
r = int(input())
print(3*(r*r))

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a = ii()
    print(pow(a,2)*3)


if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())

print(3*(a**2))

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):


r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
N=int(input())

print(3*N*N)

Solution (Python):
r=int(input())

print(3*r**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):

r = int(input())

print(3*r**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
a = int(input())
print(3 * a * a)

Solution (Python):
def main():
    r = int(input())
    print(3*r**2)
if __name__ == "__main__":
    main()

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
a=int(input())
print(3*a*a)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):

r = int(input())

print(3*r*r)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(3 * int(input()) ** 2)

Solution (Python):
a=int(input())
print(3*a**2)

Solution (Python):
a = int(input())
print(3*a**2)

Solution (Python):
print(int(input())**2 * 3)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3 * int(input())**2)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    r = int(input())
    print(3*r*r)

if __name__ == '__main__':
    main()

Solution (Python):
s = int(input())
print(3*s*s)

Solution (Python):
r = int(input())
print(r*r*3)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):


r=int(input())
print(3*pow(r,2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):


r = int(input())
print(3*r**2)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, 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
from fractions import gcd
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

r = INT()
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
int = int(input())
print(3*int*int)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()

N, A, B = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""
N = int(input())
print(3 * N ** 2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):

print(3 * int(input()) ** 2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
def main():
    r = int(input())
    print( 3 * r ** 2)
if __name__ == "__main__":
    main()

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(r**2*3)

Solution (Python):
r = int(input())

print(3 * r ** 2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
a=int(input())
print(a**2*3)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(3 * r **2)

Solution (Python):
a = int(input())
print(3*a**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3 * (r**2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
icase=0
if icase==0:
    r=int(input())
    print(3*r*r)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
r = int(input())
x = 3 * (r ** 2)
print(x)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
a = int(input())

print(3 * a * a)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(r*3*r)

Solution (Python):
r = int(input())
print(int(3*r**2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
a=int(input())
print(3*a*a)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r=int(input())

print(3*r*r)

Solution (Python):
import sys


def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, 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)]

p2D = lambda x: print(*x, sep="\n")



r=II()

print(3*r**2)

Solution (Python):
n=int(input())
print(3*n**2)

Solution (Python):
r = int(input())

print(3*pow(r,2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(3*(int(input()))**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(3*(r**2))

Solution (Python):
import sys
input = sys.stdin.readline
import math
import collections
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

r=I()
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print((int(input()))**2*3)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
a=int(input())
print(a*a*3)

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

n = int(readline())
print(3*n**2)

Solution (Python):
a = int(input())
print(3*a*a)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(3 * int(input())**2)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
def resolve():

    r=int(input())
    print(3*r**2)

resolve()

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):


r = int(input())
print(3*r**2)

Solution (Python):
import sys

def solve():
    print(3 * pow(int(input()), 2))
    
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
s=int(input())
print(3*s**2)

Solution (Python):
n = int(input())
print(3 * n * n)

Solution (Python):
print((int(input())**2)*3)

Solution (Python):
r = int(input())

print(3 * r * r)

Solution (Python):
r = int(input())
ans = 3 * r ** 2
print(ans)

Solution (Python):
r = int(input())
print(3 * (r ** 2))

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
a = int(input())
print(3*(a**2))

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
def main():
    r = int(input())
    print(3*r**2)


if __name__ == '__main__':
    main()

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

r = INT()
print(3 * r ** 2)

Solution (Python):
print(int(input()) ** 2 * 3)

Solution (Python):
a=int(input())
print(3*a*a)

Solution (Python):
r = int(input())

print(3*r**2)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
a = int(input())
print(3*a**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
a = int(input())
print(3*(a**2))

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
def q1():
    """ A - Dodecagon """
    r = int(input())
    print(3 * r**2)


if __name__ == '__main__':
    q1()

Solution (Python):
r = int(input())

print(3 * r**2)

Solution (Python):
r = int(input())

area = 3 * r ** 2

print(area)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
r=int(input())
print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
r = int(input())
S = 3 * r * r
print(S)

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r = int(input())
print(3 * r** 2)

Solution (Python):
a=int(input())
print(a*a*3)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
n = int(input())
print(3*n**2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
r=int(input())
print(3*r**2)

Solution (Python):
print(int(input())**2*3)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r = int(input())
print(3 * r ** 2)

Solution (Python):
r = int(input())
print(3*r**2)

Solution (Python):
r = int(raw_input())
print 3*r**2

Solution (Python):
print(3*int(input())**2)

Solution (Python):
n = int(input())
print(3*(n**2))

Solution (Python):
r = int(input())
print(3*r*r)

Solution (Python):

print(3 * int(input()) ** 2)

Solution (Python):
r= int(input())
print((r**2)*3)

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
print(3*int(input())**2)

Solution (Python):
r = int(input())
print(3 * r * r)

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  r = int(readline())
  print(3*(r**2))
  
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
a = input()
b= int(a)
print(3*b**2)

Solution (Python):
r = int(input())
print(3*pow(r, 2))

Solution (Python):
r = int(input())

print(3*r*r)

Solution (Python):
print(3*int(input())**2)

Solution (Python):
print(3*(int(input())**2))

Solution (Python):
r=int(input())
print(3*(r**2))

Solution (Python):
a=int(input())
print(3*a*a)

Solution (Python):
import sys

r = int(sys.stdin.readline().rstrip())

def main():
    print(3*r**2)

if __name__ ==  '__main__':
    main()

Solution (Python):
import itertools
import fractions
def main():
  r = int(input())
  print(3 * (r**2))
  
if __name__ == '__main__':
  main()

Solution (Python):
r = int(input())
print(3*(r**2))

Solution (Python):
n = int(input())
print(3 * n ** 2)

Solution (Python):
print(3 * (int(input())**2))

Solution (Python):
a=int(input())
print(3*a*a)