# include <stdio.h>
# include <stdlib.h>
# define N 3
int main();
int recursive(long int iteration);
long int counter;
int main()
{
counter = 1;
long int a = recursive(counter);
long int result = a * N * sizeof(int);
// return 0;
return result;
}
int recursive(long int iteration)
{
if (malloc(sizeof(int)*iteration
*N
) == NULL
) return counter;
int locals[iteration * N];
for (int i = 0; i < iteration * N; i++)
{
locals[i] = i + 1;
}
for (int i = 0; i < iteration * N; i++)
{
if (locals[i] != i + 1)
return iteration;
}
//free(sizeof(int)*iteration*N);
counter += 1;
return recursive(counter);
}
IyBpbmNsdWRlIDxzdGRpby5oPgojIGluY2x1ZGUgPHN0ZGxpYi5oPgoKIyBkZWZpbmUgTiAzCgppbnQgbWFpbigpOwppbnQgcmVjdXJzaXZlKGxvbmcgaW50IGl0ZXJhdGlvbik7Cgpsb25nIGludCBjb3VudGVyOwoKaW50IG1haW4oKQp7CgkJY291bnRlciA9IDE7CgkJbG9uZyBpbnQgYSA9IHJlY3Vyc2l2ZShjb3VudGVyKTsKCQlsb25nIGludCByZXN1bHQgPSBhICogTiAqIHNpemVvZihpbnQpOwoJCgkvLyByZXR1cm4gMDsKCXJldHVybiByZXN1bHQ7Cn0KCmludCByZWN1cnNpdmUobG9uZyBpbnQgaXRlcmF0aW9uKQp7CglpZiAobWFsbG9jKHNpemVvZihpbnQpKml0ZXJhdGlvbipOKSA9PSBOVUxMKSAKCXJldHVybiBjb3VudGVyOwoJaW50IGxvY2Fsc1tpdGVyYXRpb24gKiBOXTsKCWZvciAoaW50IGkgPSAwOyBpIDwgaXRlcmF0aW9uICogTjsgaSsrKQoJewoJCWxvY2Fsc1tpXSA9IGkgKyAxOwoJfQoJCglmb3IgKGludCBpID0gMDsgaSA8IGl0ZXJhdGlvbiAqIE47IGkrKykKCXsKCQlpZiAobG9jYWxzW2ldICE9IGkgKyAxKQoJCQlyZXR1cm4gaXRlcmF0aW9uOwoJfQoJCgkvL2ZyZWUoc2l6ZW9mKGludCkqaXRlcmF0aW9uKk4pOwoJY291bnRlciArPSAxOwoJcmV0dXJuIHJlY3Vyc2l2ZShjb3VudGVyKTsKfQo=