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):
import math



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

if __name__ == '__main__':
    main()

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

Solution (Python):


r = int(input())

ans = 3 * r * r

print(ans)

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

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

Solution (Python):
from sys import stdin

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

print(3 * r * r)

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

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

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())
ans = (r**2)*3
print(ans)

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

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

print(3 * r ** 2)

Solution (Python):
import math


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

Solution (Python):
import sys

def main():
    R = int(input())
    print(3*R*R)

if __name__=='__main__':
    main()

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

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

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

print(3 * (radius ** 2))
exit(0)

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

Solution (Python):
def li():
    return list(map(int, input().split()))


if __name__ == "__main__":
    r = int(input())
    print(r ** 2 * 3)

Solution (Python):


import sys

n = int(input())
ans = 3 * n * n
print(ans)

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


a = 3*(n**2)
print(a)

Solution (Python):


a = int(input())

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

print(int(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):
import sys

r= int(sys.stdin.readline())
print( 3 * r**2 )

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

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

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [r] = [int(input_raw[0])]
    print 3 * r * r

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

r = input()
r = int(r)

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):
i = input()
r = int(i)

print(3*r*r)

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

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


main()

Solution (Python):

r= int(input())

print(3*r*r)

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

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

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

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

print(3*(n**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**2)

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

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

Solution (Python):
from sys import stdin
r = int(stdin.readline().rstrip())
ans = 3 * r ** 2
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*r)

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

print(3*r**2)

Solution (Python):

r = input()

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

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

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    r = int(token[0])

    return (r,)


def solve(r,):

    return 3 * r * r




def main():
    

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Solution (Python):



r = int(input())

print(3*r*r)

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

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

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

    print(3 * r * r)


if __name__ == '__main__':
    main()

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

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

Solution (Python):

"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq


def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   

def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())


dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')


ABT = zip(A, B, totAB)
result = 0

sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)


(x >> i) & 1


dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break

add = 1 
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)


li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    


org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)




    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


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

    
if __name__ == '__main__':
    main()

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

Solution (Python):


r =  int(input())

print(3 * r * r)

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

answer = 3*r*r

print(answer)

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

Solution (Python):


n=int(input())
print(3*(n**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):
N = int(input())
print(3*N**2)

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

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

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

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

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

Solution (Python):

import sys


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



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

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(r*r*3)

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

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

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

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

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

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

Solution (Python):
import sys,heapq,math,resource
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True 
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

def setrlim():
  sys.setrecursionlimit(250000)
  soft,hard = resource.getrlimit(RLIMIT_STACK)
  
  

r = inn()
print(3*r*r)

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

area = 3 * r**2

print(area)

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

print("{}".format(3 * r**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):

import sys


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



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):
i = int(input())
print(3*i**2)

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

Solution (Python):
import collections as c
ip = lambda : map(int, input().split())

mod = 1e9+7
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):
from sys import stdin

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

input = lambda: stdin.readline()
main()

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

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

print(3 * (r ** 2))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
 
    a = int(input())
 

    print(3 * a ** 2)
 
if __name__ == '__main__':
    main()

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

print(3*N*N)

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

anser = 3 * a * a

print(anser)

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

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

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

if __name__ == "__main__":
    resolve()

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

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*r)

Solution (Python):

a = int(input())

print(3*pow(a,2))

Solution (Python):

"""
Created on Sat Jul 20 20:49:09 2019

@author: ctiuser
"""

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

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

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

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

S = 3 * r * r

print(S)

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):
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*r)

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

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

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

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(int(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(x) for x in input().split())
print(r*r*3)

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

Solution (Python):
a = list(map(int,input().split()))
print(3*(a[0]**2))

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    r = [int(x) for x in sys.stdin.readline().split()][0]

    logger.debug('{}'.format(r))

    print(3 * r**2)


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """4"""
        output = """48"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """15"""
        output = """675"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """80"""
        output = """19200"""
        self.assertIO(input, output)

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

Solution (Python):

import sys


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



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):
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(3 * pow(r,2))

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**2)

Solution (Python):

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

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

print(3*pow(r,2))

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    r = int(input())
    return 3 * r**2


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

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*r**2)

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

print(r*r*3)

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

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

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

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

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

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

Solution (Python):


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

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == "__main__":
    main()

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):
from collections import *
import sys
inp = raw_input

def err(s):
    sys.stderr.write('{}\n'.format(s))

def ni():
    return int(inp())

def nl():
    return [int(_) for _ in inp().split()]

r = ni()
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*(r**2))

Solution (Python):


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

Solution (Python):
import sys
from collections import Counter
input = sys.stdin.readline

A = int(input())

print(3*A**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):
print(3 * int(input())**2)

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

r = getN()

print(3 * r * r)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
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 II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True


def dprint(*objects):
    if debug == True:
        print(*objects)

def solve():
    a = II()
    print(3*a*a)
    pass
solve()

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
a=int(input())
print(3*a*a)

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

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

print(3 * (r ** 2))

Solution (Python):
import numpy as np
r = int(input())
print(3*r**2)

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

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

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

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):
import math

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

Solution (Python):
import sys



A = int(input())

print(3*A*A)

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

n=n*n*3
print(n)

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

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

print(3*r**2)

Solution (Python):
import sys
import numpy as np
from scipy.misc import comb
sys.setrecursionlimit(1000000)
 
r = int(input())

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

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

print (3*r*r)

Solution (Python):
words = lambda t : list(map(t, input().split()))
r = int(input())

print(3 * (r**2))

Solution (Python):
import numpy as np

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("{}".format(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*(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((r**2)*3)

Solution (Python):
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")


def main():
    N = int(input())
    print(N * N * 3)

    
if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys

readline = sys.stdin.readline

r = int(readline())

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



import sys
import math


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

N = myinput_int()[0]

print(3*N*N)

Solution (Python):
import sys
input = sys.stdin.readline

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

Solution (Python):

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

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

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

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

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

print(3*n*n)

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

Solution (Python):
"""


 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    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**2)

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

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

Solution (Python):
import numpy as np
from collections import defaultdict
from heapq import heappush, heappop


def djkstra_adj_list(adj_list, src):
    dist = defaultdict(lambda: np.inf)
    dist[src] = 0

    prev = defaultdict(lambda: None)

    queue = []
    heappush(queue, (dist[src], src))

    while len(queue) > 0:
        dist_u, u = heappop(queue)
        vs = adj_list[u]
        for v, weight in vs:
            alt = dist_u + weight
            if alt < dist[v]:
                dist[v] = alt
                prev[v] = u
                heappush(queue, (alt, v))

    return dist, prev


def djkstra_adj_mat(adj_mat, src):
    dist = defaultdict(lambda: np.inf)
    dist[src] = 0

    prev = defaultdict(lambda: None)

    queue = []
    heappush(queue, (dist[src], src))

    while len(queue) > 0:
        dist_u, u = heappop(queue)
        vs = np.argwhere(adj_mat[u] > 0).flatten()
        for v in vs:
            weight = adj_mat[u, v]
            alt = dist_u + weight
            if alt < dist[v]:
                dist[v] = alt
                prev[v] = u
                heappush(queue, (alt, v))

    return dist, prev


def main():

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


if __name__ == '__main__':
    main()

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

print(3*N*N)

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

print(3*r**2)

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

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

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

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

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

print(3 * r * r)

Solution (Python):
import fractions
from collections import deque
import numbers as np
import math


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


if __name__ == "__main__":
    main()

Solution (Python):





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

    print(N**2 * 3)

if __name__ == "__main__":
    main()

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

print(3 * r **2)

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

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

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

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

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):
N = int(input())
print(3*N*N)

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

Solution (Python):


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

Solution (Python):


import math
import sys
import itertools
import numpy as np


r =int(input())

print(r*r*3)

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

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

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


main()

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

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

def intinput(): return map(int,sys.stdin.readline().split())

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

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


import sys

sys.setrecursionlimit(10**7)


input = sys.stdin.readline


def read_h(typ=int):
    return list(map(typ, input().split()))


def read_v(n, m=1, typ=int):
    return [read_h(typ) if m > 1 else typ(input()) for _ in range(n)]


def main():
    r, = read_h()
    print(3 * r**2)


if __name__ == '__main__':
    main()

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

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

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

ans = int(3 * (a * a))
print(ans)

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

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

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*r)

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*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 * r)

Solution (Python):




if __name__ == '__main__':
    r = int(input())
    area = 3 * r * r
    print(area)

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

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

print(3*r*r)

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