运用递推
#include<iostream>
#include<math.h>
#include<string.h>
#include<string>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
long long g[35]={1},d[35]={0};
if(n==-1) break;
for(int i=1;i<=n;i++)
{
g[i]+=3*g[i-1]+2*d[i-1];
d[i]+=g[i-1]+d[i-1];
}
cout<<g[n]<<", "<<d[n]<<endl;
}
return 0;
}