C++ :

#include <bits/stdc++.h>
using namespace std;

int main() {
	 int n,i,m;
	 double s;
	 cin>>n;
	 //16 1 (16-i*2)/2  2i <= 16-2i
	 for(i = 1;i <= n / 4;i++){
	 	if(i * ((n - i * 2) / 2.0) >= s){
	 		s = i * ((n - i * 2) / 2.0);
	 		m = i;
		 }
	 }
	 
	 cout<<fixed<<setprecision(1)<<s<<endl;
	 
  	 return 0;
}

Pascal :

var a,b,c,d,e,f:longint;
begin
read(a);
b:=a div 2;
c:=b div 2;
d:=b-c;
e:=c*d;
write(e);
end.

Java :

import java.util.Scanner;
public class Main
{
    public static void main(String[] args){
       Scanner sc = new Scanner(System.in);
       int n= sc.nextInt();
       int s;
       int ss=0;
       for(int i=1;i<n;i++) {
    	   for(int j=1;j<n;j++) {
    		   if(2*(i+j)==n ) {
    			  s=i*j;
    			  if(ss<s) {
    				  ss=s; 				  
    			  }
    		   }
    	   }
    	   
       }
       System.out.println(ss);
       
  } 
}

Python :

n = int(input())
x = n // 2
m = []
for i in range(1, x + 1):
    for j in range(1, x + 1):
        if((i + j) * 2 == n):
            z = i * j
            m.append(z)
print(max(m))