Problem:
 Score : 200 points    Problem Statement Find the largest square number not exceeding N . Here, a square number is an integer that can be represented as the square of an integer.      Constraints  1 \leq N \leq 10^9  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print the largest square number not exceeding N .        Sample Input 1 10      Sample Output 1 9  10 is not square, but 9 = 3 × 3 is. Thus, we print 9 .       Sample Input 2 81      Sample Output 2 81       Sample Input 3 271828182      Sample Output 3 271821169

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

for i in range(N+2):
    if (i**2 <= N):
        k = i**2
    else:
        print(k)
        break

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

Solution (Python):
N = int(input())
print(int(pow(N,0.5)//1)**2)

Solution (Python):
print(int((int(input())**0.5//1)**2))

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

Solution (Python):
n = int(input())  
ans = 0
for j in range(0,100001):
 if j**2 <= n:
  ans = j**2
print(ans)

Solution (Python):
N = int(input())
ans = 1
for i in range(N):
    if i * i > N:
        ans = (i - 1) ** 2
        break
print(ans)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):
import math

n = int(input())

print(math.floor(math.sqrt(n)) ** 2)

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

Solution (Python):
N = int(input())
import math
for i in range(N):
     if int(math.sqrt(N-i)) == math.sqrt(N-i):
         print(N-i)
         exit()
     else:
         continue

Solution (Python):
sq=[i**2 for i in range(100000)]
n=int(input())
ans=0
for i in range(100000):
    if sq[i]>n:
        ans=i-1
        break
print(sq[ans])

Solution (Python):
import math
print(pow(int(math.sqrt(int(input()))), 2))

Solution (Python):
n = int(input())
i = 1
while True:
    if i ** 2 > n:
        print((i-1)**2)
        break

    i += 1
    if i >= 10000000:
        break

Solution (Python):
import math

def main() :
	N = int(input())
	for i in range(N,0,-1) :
		a = math.sqrt(i)
		if (a.is_integer()) :
			print(i)
			return

main()

Solution (Python):
N=int(input())
Ans=0
for i in range(100000):
    if Ans<i**2 and i**2<=N:
        Ans=i**2
print(Ans)

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

for i in range(N+2):
    if i ** 2 > N:
        print((i-1)**2)
        break

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

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

ans = int(math.sqrt(N))
print(ans**2)

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

x = N**(0.5)
if(N%x == 0):
  print(N)
else:
  print(int(x)**2)

Solution (Python):
n = int(input())
x = 0
while x**2<=n:
    x += 1
print((x-1)**2)

Solution (Python):
def abc077_b():
    n = int(input())
    print(int(n ** 0.5) ** 2)


abc077_b()

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

ans = 1
for i in range(N + 1):
    if i * i <= N:
        ans = i * i
    else:
        break

print(ans)

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

ans = 1
for i in range(N + 2):
    if i * i <= N:
        ans = i * i
    else:
        break

print(ans)

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

for i in range(N + 2):
    if i * i > N:
        break

print((i - 1) * (i - 1))

Solution (Python):
n = int(input())
i = 0
while i**2 <= n:
    i +=1
print((i-1)**2)

Solution (Python):

import math
a = int(input())
print(int(math.sqrt(a))**2)

Solution (Python):



def main():
    """Function."""
    n = int(input())

    temp = 1
    while temp ** 2 <= n:
        temp += 1

    print((temp-1) ** 2)


if __name__ == "__main__":
    main()

Solution (Python):
from math import sqrt


def main():
    n = int(input())
    print(int(sqrt(n)) ** 2)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
i = 1
out = 0
while i ** 2 <= n:
   out = i ** 2
   i += 1
print(out)

Solution (Python):

import math
N = int(input())
n = int(math.sqrt(N))
print(n ** 2)

Solution (Python):

N = int(input())
for i in range(1,N+1):
    if N == 1:
        print(1)
        break
    if i**2 > N:
        print((i-1)**2)
        break

Solution (Python):
import math
N = int(input())
root = math.sqrt(N)
root = math.floor(root)
ans = root*root
print(ans)

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

if(N==1 or N==2):
    print("1")
    quit()

for i in range(N):
    kekka=i**2
    
    if(kekka>N):
        print((i-1)**2)
        quit()

Solution (Python):
n = int(input())
import math
m = int(math.sqrt(n))
print(m**2)

Solution (Python):

N=int(input())

for i in range(1,10**5):
    if i**2>N:
        break

print((i-1)**2)

Solution (Python):
import math
N = int(input())
print(int(math.sqrt(N))**2)

Solution (Python):
import math
N = input()
print int(math.sqrt(N)) ** 2

Solution (Python):
from math import sqrt

n = int(input())
ans = int(sqrt(n))
print(pow(ans,2))

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

for i in range(1, n + 2):
    if i ** 2 > n:
        print((i - 1) ** 2)
        break

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

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

Solution (Python):
import math

n = int(input())
n = math.sqrt(n)
n = math.floor(n)
m = n * n
print(m)

Solution (Python):
import math;a=int(math.sqrt(int(input()))//1);print(a*a)

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

for i in range(10**5):
    if(i**2 > N):
        print((i-1)**2)
        break

Solution (Python):
n = int(input())
ans=0
for i in range(1,n+1):
    if i*i > n:
        break
    else:
        ans = i*i
print(ans)

Solution (Python):
import math
a = int(input())
for i in range(a,-1,-1):
    if math.sqrt(i).is_integer() == True:
        print(i)
        break

Solution (Python):
import math as m
n = int(input())
for i in range(n,-1,-1):
  if m.sqrt(i) == int(m.sqrt(i)):
    print(i)
    exit()

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

i = 1

while(True):
	if( i ** 2 <= max ):
		i += 1
		continue
	else: break


print( (i-1)**2 )

Solution (Python):
n = int(input())
count = 1
while True:
    if count**2 <= n and n < (count+1)**2:
        print(count**2)
        break
    else:
        count += 1

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

while True:
	if ans * ans > n:
		break
	ans += 1
	
print((ans-1)*(ans-1))

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

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

for i in range(N, 0, -1):
    n = math.sqrt(i)
    if float.is_integer(n):
        print(i)
        break

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

print(int(N ** 0.5) ** 2)

Solution (Python):
n = int(input())
x = int(n ** 0.5)
print(x * x)

Solution (Python):
import math
x = int(input())
print(int(math.sqrt(x))**2)

Solution (Python):
n = int(input())
lo, hi = 1, n

while hi - lo > 1:
  x = (hi + lo) // 2
  if x * x > n:
    hi = x
  else:
    lo = x

print(lo * lo)

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

print((int(N**0.5)**2))

Solution (Python):
import math
n = int(input())
print(math.floor(n**0.5)**2)

Solution (Python):
n = int(input())
for i in range(100000):
    if n < i**2:
        print((i-1)**2)
        break

Solution (Python):


n = int( input())

i=0
while True:
  nn=i**2
  if nn < n:
    i=i+1
    continue
  if nn==n:
    break
  i=i-1
  break
print(i**2)

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

Solution (Python):
from sys import stdin


def main() -> None:
    n = int(next_str())
    print(int(n ** 0.5) ** 2)

def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin


def main() -> None:
    n = int(next_str())

    for i in range(1, n + 1):
        if not judge(i + 1, n):
            print(i ** 2)
            break


def judge(i: int, n: int) -> bool:
    if i ** 2 <= n:
        return True
    return False


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
for i in range(n+1):
    if i**2<=n:
      c=i**2
    else:
        break
print(c)

Solution (Python):
import math

N = int(input())
print((int(math.sqrt(N)))**2)

Solution (Python):
import math
N = int(input())
print(math.floor((math.sqrt(N)))**2)

Solution (Python):
N = int(input())
ans = 0
for i in range(100000):
    if i**2 <= N:
        ans = i**2
print(ans)

Solution (Python):
n=int(input())
i=0
while i**2<=n:
    i+=1
print((i-1)**2)

Solution (Python):
import math
n=int(input())
print(int(math.sqrt(n))**2)

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

Solution (Python):
import math

n = int(input())
print(int(math.sqrt(n)) ** 2)

Solution (Python):
import math

n = int(input())
s = math.sqrt(n)
while s.is_integer() == False:
  n -= 1
  s = math.sqrt(n)
print(n)

Solution (Python):
n = int(input())
print(max([x**2 for x in range(1,100000) if x**2 <= n]))

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

for i in range(n,-1,-1):
  if math.sqrt(i) % 1 ==0:
    print(i)
    exit()

Solution (Python):
import math
print(math.floor(math.sqrt(int(input())))**2)

Solution (Python):
N = int(input())
l = [i**2 for i in range(10**5)]
l.append(N)
l.sort()
if len(l) == len(list(set(l))) + 1:
  print(N)
else:
  print(l[l.index(N)-1])

Solution (Python):
N = int(input())
i = 1
ans = 1
while i**2 <= N:
    if i**2 <= N:
        ans = i**2
    i += 1
print(ans)

Solution (Python):
import math
print(int(math.sqrt(int(input()))) ** 2)

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

kotae = []
for i in range(N+1):
    if i*i > N:
        break
    else:
        kotae.append(i*i)
    
print(max(kotae))

Solution (Python):



def main():
    from math import sqrt

    n = int(input())
    ans = 0

    for i in range(int(sqrt(n)) + 1):
        ans = max(ans, i ** 2)

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
i = 1
while i * i <= n:
    i += 1
i -= 1
print(i ** 2)

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

i = 1
while i*i <= n:
  ans = i*i
  i += 1
  
print(ans)

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

Solution (Python):
n=int(input())
i=1
a=[]
while i*i<=n:
    a.append(i*i) 
    i+=1
print(a[len(a)-1])

Solution (Python):
from math import sqrt, floor
N = int(input())
print(floor(sqrt(N))**2)

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

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

i = 1
now = 0

while True:
    if i * i > n:
        print(now)
        break

    now = i * i
    i += 1

Solution (Python):
import numpy as np

n = int(input())
a = int(round(np.sqrt(n)))
b = int(a-1)
c = int(a+1)

if c**2 < n+1:
    print(c**2)
elif a**2 < n+1:
    print(a**2)
elif b**2 < n+1:
    print(b**2)

Solution (Python):
import math
n = int(input())
print(int(math.floor(math.sqrt(n)) ** 2))

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

for i in range(N,0,-1):
	if math.sqrt(i) == int(math.sqrt(i)):
		print(i)
		break

Solution (Python):
for i in range(int(input()),0,-1):
    if int(i**(1/2))**2==i:
        print(i)
        exit()

Solution (Python):
N=int(input())
a=1
b=0
i=0
while b==0:
    i+=1
    b=i**2
    if b>N:
        print(a)
        exit()
    a=b
    b=0

Solution (Python):
import math

N = int(input())

ans = []
for i in range(int(math.sqrt(N)) + 1):
    if i**2 <= N:
        ans.append(i**2)

print(ans[len(ans)-1])

Solution (Python):
N = int(input())
L = []
for i in range(10**5) :
    l = i**2
    if N < l :
        print(L[-1])
        break
    else :
        L.append(l)

Solution (Python):
import math

N = int(input())
a = int(math.sqrt(N))
print(a*a)

Solution (Python):
n=int(input())
for i in range(int(n**(1/2)+1)):
  if i**2<=n<(i+1)**2:
   print(i**2)
   break

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

tmp = 1
tmp2 = tmp*tmp

while N >= tmp2:
    tmp += 1
    tmp2 = tmp*tmp
print((tmp - 1)**2)

Solution (Python):
n = int(input())
i = 0
while 1:
    i += 1
    if i**2 > n:
        print((i-1)**2)
        break

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

print((math.floor(n**(1/2)))**2)

Solution (Python):
N=int(input())
for i in range(N+1):
    if i*i>N:
        break
    ans=i*i
print(ans)

Solution (Python):
n = int(input())
num = 1
ans = 1
while num * num <= n:
    ans = num * num
    num += 1
print(ans)

Solution (Python):
n=int(input())
for i in range(n+2):
    if i*i>n:
        print((i-1)*(i-1))
        exit()

Solution (Python):
N=int(input())
for i in range(32*10**4):
    if i*i<=N<(i+1)*(i+1):
        print(i*i)

Solution (Python):
from math import sqrt
from math import floor
n = int(input())
ans = floor(sqrt(n))
print(ans**2)

Solution (Python):
N = int(input())
max_num = 0
for i in range(N):
    max_num = i**2
    if max_num > N:
        print((i-1)**2)
        exit()
print(1)

Solution (Python):
import numpy as np
N=int(input())
print((int(np.sqrt(N)))**2)

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = int(input())
    i = 1
    while i * i <= N:
        i += 1
    print((i - 1) * (i - 1))


if __name__ == '__main__':
    main()

Solution (Python):


print(int(int(input())**.5)**2)

Solution (Python):
n=int(input())
i=1
while n>=i**2:
  i+=1
print((i-1)**2)

Solution (Python):
n = int(input())
i = 1
while n >= i ** 2:
    i += 1
print((i - 1) ** 2)

Solution (Python):
n = int(input())
i = 1
while n >= i * i:
    i += 1
print((i - 1) * (i - 1))

Solution (Python):
from math import floor, sqrt

print(floor(sqrt(int(input()))) ** 2)

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

Solution (Python):
n=int(input())
i=1
while i*i<=n:s=i*i;i+=1;
print(s)

Solution (Python):

n = int(input())

cnt = 1

while cnt**2 <= n :
    cnt = cnt + 1
    
cnt = cnt - 1
print(cnt**2)

Solution (Python):
max = 0
n = int(input())
i = 0
while i**2 <= n :
    max = i**2
    i += 1
print(max)

Solution (Python):
import numpy as np
n = int(input())

print(int(np.sqrt(n))**2)

Solution (Python):

n = int(input())
N = int(float(n)**0.5)
N2 = N**2
print(N2)

Solution (Python):

n = int(input())
p = 0
for i in range(int(n**0.5)+1):
    if i**2<=n: p=i
print(p**2)

Solution (Python):

n = int(input())
i = 1
f = 0
while i**2<=n :
    f = i**2
    i = i +1
print(f)

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

while k ** 2 <= n :
    k += 1

print((k - 1) ** 2)

Solution (Python):

n = int(input())
num = 1

a = int(n**(0.5))

        
print(a**2)

Solution (Python):

n = int(input())
cnts = 0
while(cnts**2 <= n):
    cnts += 1

print((cnts-1)**2)

Solution (Python):


n = int(input())
a=1
raw=0

while raw <= n:
    raw=a*a
    a=a+1

print((a-2)*(a-2))

Solution (Python):

n = int(input())
s = 1
p = 1
while (True):
    p = s * s
    s = s + 1
    if (s*s > n) :
        break
    
print(p)

Solution (Python):

n = int(input())
print(int(n**(1/2))**2)

Solution (Python):
import math
N = int(input())
print(pow(int(math.sqrt(N)), 2))

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

Solution (Python):
a = int(input())
for i in range(a+1):
    if (a-i)**(1/2) % 1 == 0:
        print(a-i)
        exit()

Solution (Python):
print(int(int(input())**.5)**2)

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

Solution (Python):
i=input;print(int(int(i())**0.5)**2)

Solution (Python):

n=int(input())
print(int((n**(.5)//1)**2))

Solution (Python):
N = int(input())
ans = 1
for num in range(1, N):
    if num**2 <=N:
        ans = max(ans, num**2)
    else:
        break
print(ans)

Solution (Python):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())


print(int(math.sqrt(int(input())))**2)

Solution (Python):

n=int(input())

a = int(n**(0.5))
print(a**2)

Solution (Python):
N = int(input())
L = []
for i in range(31624) :
    l = int(i**2)
    L.append(l)
for j in range(31624) :
    if L[j+1] > N :
        print(L[j])
        break

Solution (Python):
N = int(input())
ans = 1
for i in range(10 ** 5):
    if i ** 2 <= N:
        ans = i ** 2
    else:
        break
print(ans)

Solution (Python):
N = int(input())
for i in range(N+2):
    if N < i**2:
        j = i - 1
        break
print(j**2)

Solution (Python):
N = int(input())
for i in range(N+1):
    if N < i**2:
        j = i - 1
        break
if N == 1:
    print(1)
else:
    print(j**2)

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

Solution (Python):

import math as np


def main():
    n = int(raw_input())
    a = int(np.sqrt(n))
    print(a * a)


if __name__ == '__main__':
    main()

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

i = 1

for i in range(100000):
    if i**2 > IN:
        print((i-1)**2)
        break

Solution (Python):

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

    ans = 1
    for i in range(1,n):
        if i*i > n:
            break
        ans = i*i

    print(ans)


if __name__ == "__main__":
        main()

Solution (Python):
import math

N = int(input())

print(int(math.sqrt(N)) ** 2)

Solution (Python):
import math
N = int(input())
print(math.floor(math.sqrt(N))**2)

Solution (Python):
import math
N = int(input())
s = int(math.sqrt(N))
print(s * s)

Solution (Python):
print(int(int(input())**.5)**2)

Solution (Python):


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

    for i in range(n, 0, -1):
        if int(i ** 0.5) ** 2 == i:
            print(i)
            break


if __name__ == '__main__':
    main()

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

before_square = 1
max_square = 1
while before_square**2 <= n:
    max_square = before_square ** 2
    before_square += 1

print(max_square)

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

before_square = 1
while before_square**2 <= n:
    before_square += 1
before_square -= 1

print(before_square**2)

Solution (Python):
import math
N = int(input())
print(int(math.sqrt(N))**2)

Solution (Python):
import math
from math import modf
N =int(input())

while(True):
    a = math.sqrt(N)
    b = a*a
    decimal, integer = modf(a)
    if decimal==0:
        print(N)
        exit()
    N-=1

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

Solution (Python):
n = int(input())
i = 1
while i ** 2 <= n:
    i += 1
print((i-1) ** 2)

Solution (Python):
n=int(input())
ans=1
while 1:
    if (ans+1)**2>n: break
    ans+=1
print(ans**2)

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

Solution (Python):
N = int(input())
ans = 0
for i in range(1, 32000):
	if pow(i, 2) <= N and pow(i, 2) >= ans:
		ans = pow(i, 2)
print(ans)

Solution (Python):
n = int(input())
print(sorted(filter(lambda x: x <= n, [i ** 2 for i in range(int(n ** 0.5) + 1)]))[-1])

Solution (Python):
n = int(input())
ans = 0
for i in range(1, 42500)[::-1]:
    if i * i <= n:
        ans = i*i
        break

print(ans)

Solution (Python):
N = int(input())
ans = 0
for i in range(1, 32000):
	if i ** 2 <= N and i ** 2 >= ans:
		ans = i * i
print(ans)

Solution (Python):
"""
https://abc077.contest.atcoder.jp/tasks/abc077_b
"""
n=int(input())
i=1
while (i**2)<=n:
    i=i+1
print((i-1)**2)

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

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

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

L = []
for i in range(N + 1):
    if i * i <= N:
        L.append(i * i) 
    else:
        break

print(max(L))

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

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

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

i=1
while i**2<=N:
    i=i+1
print((i-1)**2)

Solution (Python):
import math

N=int(input())

for i in range(N,-1,-1):
    a=math.ceil(math.sqrt(i))
    if a*a==i:
        print(i)
        break

Solution (Python):
A=int(input())
print(int((A**(0.5)//1)**2))

Solution (Python):
import math
N = int(input())
m = math.sqrt(N)
print(int(m)**2)

Solution (Python):


N = int(input())

cnt = 1

while True:
    if cnt ** 2 > N:
        
        print((cnt -1) ** 2)
        exit()
    else:
        cnt += 1

Solution (Python):


N=int(input())
X=1
M=1
while N>=M:
    X=X+1
    M=X*X
   
X=X-1
M=X*X
    
print(M)

Solution (Python):
import math

N = int(input())

x = math.floor(math.sqrt(N))
print(x * x)

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

ans = 1
for i in range(1, N):
    if ans <= i ** 2 <= N:
        ans = i ** 2
    else:
        break

print(ans)

Solution (Python):
N = int(input())
N_s = (N ** (1/2)) // 1
print(int(N_s ** 2))

Solution (Python):
import math
N=int(raw_input())
sq=int(math.sqrt(N))
print sq*sq

Solution (Python):
import math
N=int(input().strip())
rn=math.sqrt(N)
if int(rn)-N==0:
    print(N)
else:
    print(int(rn)**2)

Solution (Python):
N=int(input())
i=0
max_root=0
while max_root<=N:
    i+=1
    max_root=i**2
    max_root_1=(i-1)**2
print(max_root_1)

Solution (Python):
N = int(input())
A = 0
B = 0
i = 0
while True:
    i += 1
    B = A
    A += 2 * i - 1
    if A > N:
        break
print(B)

Solution (Python):
N = int(input())
for i in range(1,pow(10,5)):
    if pow(i,2) > N:
        print(pow(i-1,2))
        break

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

res = 1
idx = 1
while True:
    tmp = idx * idx
    if tmp > N:
        print(res)
        exit()
    res = tmp
    idx += 1

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

for i in range(N+1):
    n = i*i
    if n > N:
        break
        
    res = n

print(res)

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


def max_square(n):
    """
    >>> max_square(10)
    9
    >>> max_square(81)
    81
    >>> max_square(271828182)
    271821169
    """
    base = 0
    while (base + 1)**2 <= n:
        base += 1
    return base**2


print(max_square(N))

Solution (Python):


n = int(input())
root = 1
while root**2 <= n:
    root += 1
print((root-1)**2)

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

sq = 0
i = 0
while N >= sq:
    i += 1
    sq = i ** 2

print((i-1)**2)

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

a = math.sqrt(n)
print(int(a)*int(a))

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

print('{}'.format(int(n**(1/2))**2))

Solution (Python):

N = int(input())

i = 1

while i ** 2 <= N:
    i += 1

print((i - 1) ** 2)

Solution (Python):
import math
n = int(input())
ans = math.sqrt(n)
print(int(ans)**2)

Solution (Python):
import math

N = int(input())

print(math.floor(math.sqrt(N)) ** 2)

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

heiho = 1
kazu = 1

while heiho<=N:
    heiho = kazu*kazu
    kazu += 1

print((kazu-2)**2)

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

Solution (Python):
from math import sqrt, floor

N = int(input())
print(floor(sqrt(N)) ** 2)

Solution (Python):
a = int(input())
b = 0
while True:
    if b **2 > a:
        break
    b += 1
print((b-1) ** 2)

Solution (Python):
print(int(int(input())**.5)**2)

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

Solution (Python):
import math
print(math.floor(math.sqrt(int(input())))**2)

Solution (Python):
N = int(input())
ans = 1
for i in range(1, N):
    if i**2 <= N:
        ans = i**2
    else:
        break
print(ans)

Solution (Python):
import math
N = int(input())
print(math.floor(math.sqrt(N))**2)

Solution (Python):
import math

N = int(raw_input())
print int(math.sqrt(N)) * int(math.sqrt(N))

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

Solution (Python):
def main():
    N = int(input())
    n = N**0.5
    n = int(n//1)
    return n**2

print(main())

Solution (Python):
n=int(input())
ma=0
i=0
while True:
  if i*i>n:
    print(ma)
    exit()
  ma=i*i
  i+=1

Solution (Python):
import math

a = int(input())
b = math.sqrt(a)
c = math.floor(b)
d = c**2

print(d)

Solution (Python):
N = int(input())
ans = 1
c = 1
while c<=N**(1/2):
    c += 1
    if c**2<=N:
        ans = c
print(ans**2)

Solution (Python):
n = int(input())
i = 1
while True:
  if i**2 > n:
    print((i-1)**2)
    break
  i += 1

Solution (Python):
import math

n = int(input())
print(int(math.sqrt(n))**2)

Solution (Python):
N = int(input())
while True:
    if N**.5 - int(N**.5) == 0:
        break
    N -= 1
print(N)

Solution (Python):
import math
N = int(input())
print(int(math.sqrt(N))**2)

Solution (Python):
import math
n = int(input())
for i in range(n, 0, -1):
  if int(math.sqrt(i)) ** 2 == i:
    print(i)
    break

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

Solution (Python):
N = int(input())
for i in range (100000):
    if N < i*i:
        print((i-1)*(i-1))
        break

Solution (Python):
import math
N = int(math.sqrt(int(input())))
print(N*N)

Solution (Python):
import math
print((int(math.sqrt(int(input()))))**2)

Solution (Python):
N = int(input())
while True:
    if N**.5 - int(N**.5) == 0:
        break
    N -= 1
print(N)

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)

Solution (Python):
N = int(input())
for i in range(N,0,-1):
    if int(i**(1/2)) == i**(1/2):
        print(i)
        break

Solution (Python):
N = int(input())
for i in range(N,0,-1):
    if int(i**(1/2)) == i**(1/2):
        print(i)
        break

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

while i*i <= n:
    i += 1

print((i-1)**2)

Solution (Python):
N = int(input())
ans = 1
while (ans+1)*(ans+1) <= N:
    ans += 1

print(ans*ans)

Solution (Python):
import math
N = int(input())
b = math.floor((math.sqrt(N)))
print(b*b)

Solution (Python):
import math
n=int(input())
a=math.sqrt(n)
print(int(a)**2)

Solution (Python):
from math import sqrt
print(int(sqrt(int(input())))**2)

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

while True:
    if (a+1)**2>N:
        break
    a+=1
print(a**2)

Solution (Python):
x = int(input())
ans = 0
for i in range(x+1):
      if i*i > x:
            break
      ans = i*i
print(ans)

Solution (Python):
from math import sqrt, floor

n = int(input())
print(floor(sqrt(n)) ** 2)

Solution (Python):
n = int(input())
import math as m
x = round(m.sqrt(n)) + 1
while x > m.sqrt(n) :
    x = x - 1
    
print(x*x)

Solution (Python):
import math

x = math.floor(math.sqrt(int(input())))
print(x * x)

Solution (Python):
n=int(input())
print(list(filter(lambda x:x*x<=n,range(int(1e5))))[-1]**2)

Solution (Python):
n = int(input())
for x in range(n+1):
    if x**2 <= n:
        hold = x**2
    elif x**2 > n:
        break
print(hold)

Solution (Python):
n = int(input())
p = 0
while p**2 <= n:
    p += 1

print((p-1)**2)

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()


n = int(arr_data[0][0])

res=math.sqrt(n)


print(int(math.pow(math.floor(res),2)))

Solution (Python):
N = int(input())
ans = 0
for i in range(N+1):
    if i**2 > N:
        break
    ans = max(ans, i)
print(ans**2)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

n = ni()
ans = 0
for i in range(1, 100000):
    if i**2 > n:
        break
    ans = i**2

print(ans)

Solution (Python):
import math
n = int(input())
print(int(math.sqrt(n))**2)

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

for i in range(31623):
    if (N >= i**2) and (N < (i+1)**2):
        print(i**2)
        break
    else:
        pass

Solution (Python):
import numpy as np
n = int(input())
print(int(np.sqrt(n))**2)

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

cd = int(math.sqrt(n))
print(cd*cd)

Solution (Python):
N = int(input())
i = 1
while True:
    if (i + 1) ** 2 > N:
        print(i ** 2)
        break
    i += 1

Solution (Python):
import math
n = int(input())
print(int(math.sqrt(n))**2)

Solution (Python):
N=int(input())
cnt=1
while cnt*cnt<=N:
  cnt+=1
print((cnt-1)*(cnt-1))

Solution (Python):
N = int(input())
count = 1
while (count+1)*(count+1) <=N:
  count += 1
print(pow(count,2))

Solution (Python):
import math
N = int(input())
print(int(math.floor(N**0.5))**2)

Solution (Python):





if __name__ == '__main__':
    import math

    number = int(input())
    sqrt_number = int(math.sqrt(number))
    result = sqrt_number ** 2
    print(result)

Solution (Python):
from math import sqrt

base = int(sqrt(int(input())))

print(base * base)

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

Solution (Python):
import math
n = int(input())
while True:
  if math.sqrt(n) == math.floor(math.sqrt(n)):
    print(n)
    break
    
  n -= 1

Solution (Python):
jk = int(input())
import math
ol = math.sqrt(jk)
print(int(ol) ** 2)

Solution (Python):
N=int(input())
import math
n=math.sqrt(N)
print(int(n)**2)

Solution (Python):
import math
N=int(input())
ans=int(math.sqrt(N))
print(ans**2)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)


def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))


def to_bin(x):
    return bin(x)[2:]


def dim2input(N):
    li = []
    for _ in range(N):
        li.append(list(map(int, input())))
    return li



dp = None

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

    ans = 0
    for i in range(math.ceil(N**0.5), 0, -1):
        if i * i <= N:
            ans = i * i
            break

    print(ans)

main()

Solution (Python):


import math
n = int(input())
for i in range(n, 0, -1):
    square_root = int(math.sqrt(i))
    if i == square_root ** 2:
        print(i)
        break

Solution (Python):
import math
N=int(input())
ans=int(math.sqrt(N))
print(ans**2)

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

Solution (Python):

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

    num = 1
    for i in range(6):
        if N >= (10**i)**2 and N < (10**(i+1))**2:
            for j in range(10**i, 10**(i+1)):
               if j**2 > 10**9 or j**2 > N:
                   print (num)
                   return
               else:
                   num = j**2
               

    print (num)


if __name__ == "__main__":
    
    
    main()

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

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

from math import sqrt

print(int(sqrt(N)) ** 2)

Solution (Python):
N = int(input())
a = 1
while(True):
    if(a * a > N):
        break
    a += 1
a = a - 1
print(a * a)

Solution (Python):
import math
n = int(input())
x=int(math.sqrt(n)//1)
print(x*x)

Solution (Python):
import math
n = int(input())
x=int(math.sqrt(n)//1)
print(x*x)

Solution (Python):
import math
N = int(input())
print(int(math.sqrt(N))**2)

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

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

b = math.floor(math.sqrt(n))
print(b*b)

Solution (Python):
k = int(raw_input())
i = 1
while(i ** 2 <= k):
    i += 1

print (i-1)**2

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

Solution (Python):
import math
print(int(math.sqrt(int(input())))**2)