What would be the time complexity of the following algorithm?

int sum $=0$;

for $($i $=0$; i $<$ n; i$++)\{$

for $($j $=0$; j $<$ n; j$++)\{$

for $($k $=0$; k $<$ n; k$++)\{$

if $($i $==$ j $==$ k$)\{$

for $($l $=0$; l $<$ n$*$n$*$n; l$++)\{$

sum $=$ i $+$ j $+$ k $+$ l;

$\}$

$\}$

$\}$

$\}$

$\}$