#include<bits/stdc++.h>

using namespace std;

#define pb push_back
const int maxi = 1e6+10;
const long long mo = 1000000007;
vector<int> v[maxi];
string s[3];
int a[maxi];
int grundy[maxi];
int tren[3][3];
int ob[maxi];
long long n;
long long dp[100][8];
long long cnt[2][8];

void read_data()
{
    freopen("ttt.in","r", stdin);
    cin>>n;
    cin>>s[0]>>s[1]>>s[2];

    fclose(stdin);
}

void print_data()
{
   freopen("ttt.out","w", stdout);

   long long ans = 0;

   for (int i= 1;i<8;i++)
    ans+=cnt[0][i];

    ans%=mo;

     cout<<ans<<endl;
    fclose(stdout);
}

int finish()
{
    for (int i=0;i<3;i++)
    {
        int ima = 0;

        for (int j = 0; j<3;j++)
            ima+=tren[i][j];

        if (ima == 3) return 1;

        ima = 0;
        for (int j=0;j<3;j++)
            ima+=tren[j][i];

        if (ima == 3) return 1;
    }

    if (tren[0][0] && tren[1][1] && tren[2][2]) return 1;
    if (tren[0][2] && tren[1][1] && tren[2][0]) return 1;

    return 0;
}

void convert(int mask)
{
      for (int i=0;i<9;i++)
    {
        if (mask&(1<<i))
          tren[i/3][i%3] = 1; else
          tren[i/3][i%3] = 0;
    }

}
int calc_grundy(int mask)
{
    if (ob[mask]) return grundy[mask];

    ob[mask] =  1;
    vector<int> mex;

    convert(mask);

    if (finish())
    {
        grundy[mask] =  0;
        return 0;
    }

    for (int i=0;i<9;i++)
        if ((mask&(1<<i))==0) mex.pb(calc_grundy(mask| (1<<i)));

    for (int i=0;i<=10;i++)
    {
        int nasao = 0;

        for (auto j:mex)
            if (j==i) nasao = 1;
        if (!nasao)
        {
            grundy[mask] = i;
            break;
        }
    }

    return grundy[mask];
}

void solve()
{
    for (int i=0;i<(1<<9);i++)
        if (!ob[i])
            calc_grundy(i);

    for (int mask=0;mask<(1<<9);mask++)
    {
        convert(mask);

        if (finish()) continue;

        int ok = 1;
        for (int i=0;i<3;i++)
            for (int j=0;j<3;j++)
            if ((tren[i][j] == 0 && s[i][j] == '#') || (s[i][j]=='.' && tren[i][j]==1)) ok = 0;

        if (ok) {dp[0][grundy[mask]]++;}
    }

    for (int i = 1;i<100;i++)
    {
        for (int j = 0; j<8;j++)
            for (int k=0;k<8;k++)
            dp[i][j^k]  = (dp[i][j^k] + dp[i-1][j] *dp[i-1][k])%mo;
    }

   cnt[0][0] = 1;


   for (int i=0;i<62;i++)
    if (n&(1ll<<i))
   {
       for (int j=0;j<8;j++)
        for (int k =0; k<8;k++){

          cnt[1][j^k] = (cnt[1][j^k] + cnt[0][j]*dp[i][k])%mo;
        }

         for (int j = 0; j<8;j++)
            swap(cnt[0][j], cnt[1][j]);

        for (int j=0;j<8;j++)
            cnt[1][j] = 0;
   }

}
int main()
{
    read_data();
    solve();
    print_data();

}

// ko mi tebe uze Tamara,
//prodala si suze drugima
//nocima ja sanjam tvoje tragove
//kuda idu izgubljene devojke