#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    cin>>s;
    if(s[0]=='S' && s[2]=='N')
        cout<<7-0;
    else if(s[2]=='T')
        cout<<7-6;
    else if(s[0]=='F')
        cout<<7-5;
    else if(s[2]=='U')
        cout<<7-4;
    else if(s[0]=='W')
        cout<<7-3;
    else if(s[2]=='E')
        cout<<7-2;
    else if(s[0]=='M')
        cout<<7-1;

   return 0;
}

#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
#define itn int
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>=1;i--)
#define all(vec) vec.begin(),vec.end()
#define sort(vec) sort((vec).begin(),(vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef tuple<ll,ll,ll> tlll;
typedef tuple<int,int,int> tiii;
const ll mod=1e9+7;
const int inf=1<<30;
const ll lnf=1ll<<60;

int main(){
  ll k; cin >> k;
  ll n=50;
  vector<ll> ans(50);
  rep(i,50) ans[i]=i+k/n;
  for(int i=n-k%n;i<n;i++) ans[i]++;
  cout << n << endl;
  rep(i,n) cout << ans[i] << " ";
  cout << endl;
}