#include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(), (x).end()
using namespace std;
bool check(string s){
int q = 0;
if (s.size() == 0)
return true;
for (int i = 0;i < s.size();i++)
if (s[i] == '@')
q++;
if (q == 1){
if (s[0] != '@' and s.back() != '@')
return true;
}
return false;
}
int main()
{
string s;cin>>s;
for (int i = 1;i < s.size(); i++){
if (s[i-1] == '@'){
if (i+1 < s.size() )
s.insert(i+1, ",");
}
}
for (int i = s.size() -1 ;i >= 0; i--){
if(s[i]=='@')
break;
if (s[i] == ',')
s.erase(i, 1);
}
string temp = "";
bool ok = true;
for (int i = 0;i < s.size(); i++){
if (s[i] == ','){
if (!check(temp)){
ok = false;
break;
}
temp = "";
}else{
temp += s[i];
}
}
if (!check(temp))
ok = false;
if (ok)
cout<<s;
else
cout<<"No solution";
return 0;
}
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |