A small example of compute Fibonacci's formula statically in C++

How to implement a algorithm  computing Fibonacci's formula statically in C++? If it can be done then the more efficient code will be produced. OK, look the a small example below.

template<unsigned int N>
struct Fibonacci {

static unsigned int const value = Fibonacci<N-1>::value + Fibonacci<N-2>::value;

};

template<>
struct Fibonacci<1> {

static unsigned int const value = 1u;

};

template<>
struct Fibonacci<2> {

static unsigned int const value = 2u;

};

int main(int argc, char *argv[]) {

unsigned int v3 = Fibonacci<3>::value;
unsigned int v9 = Fibonacci<9>::value;

return (0);

}